Pub Date : 2025-07-01Epub Date: 2025-01-17DOI: 10.1016/j.jcta.2025.106007
Sándor Z. Kiss , Csaba Sándor
Let be an integer and let A be a set of nonnegative integers. For a k-tuple of positive integers with , we define the additive representation function . For , Moser constructed a set A of nonnegative integers such that holds for every nonnegative integer n. In this paper we characterize all the k-tuples and the sets A of nonnegative integers with for every integer .
{"title":"Unique representations of integers by linear forms","authors":"Sándor Z. Kiss , Csaba Sándor","doi":"10.1016/j.jcta.2025.106007","DOIUrl":"10.1016/j.jcta.2025.106007","url":null,"abstract":"<div><div>Let <span><math><mi>k</mi><mo>≥</mo><mn>2</mn></math></span> be an integer and let <em>A</em> be a set of nonnegative integers. For a <em>k</em>-tuple of positive integers <span><math><munder><mrow><mi>λ</mi></mrow><mo>_</mo></munder><mo>=</mo><mo>(</mo><msub><mrow><mi>λ</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>λ</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>)</mo></math></span> with <span><math><mn>1</mn><mo>≤</mo><msub><mrow><mi>λ</mi></mrow><mrow><mn>1</mn></mrow></msub><mo><</mo><msub><mrow><mi>λ</mi></mrow><mrow><mn>2</mn></mrow></msub><mo><</mo><mo>⋯</mo><mo><</mo><msub><mrow><mi>λ</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span>, we define the additive representation function <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>A</mi><mo>,</mo><munder><mrow><mi>λ</mi></mrow><mo>_</mo></munder></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mo>|</mo><mo>{</mo><mo>(</mo><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>a</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>)</mo><mo>∈</mo><msup><mrow><mi>A</mi></mrow><mrow><mi>k</mi></mrow></msup><mo>:</mo><msub><mrow><mi>λ</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mrow><mi>λ</mi></mrow><mrow><mi>k</mi></mrow></msub><msub><mrow><mi>a</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>=</mo><mi>n</mi><mo>}</mo><mo>|</mo></math></span>. For <span><math><mi>k</mi><mo>=</mo><mn>2</mn></math></span>, Moser constructed a set <em>A</em> of nonnegative integers such that <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>A</mi><mo>,</mo><munder><mrow><mi>λ</mi></mrow><mo>_</mo></munder></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mn>1</mn></math></span> holds for every nonnegative integer <em>n</em>. In this paper we characterize all the <em>k</em>-tuples <span><math><munder><mrow><mi>λ</mi></mrow><mo>_</mo></munder></math></span> and the sets <em>A</em> of nonnegative integers with <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>A</mi><mo>,</mo><munder><mrow><mi>λ</mi></mrow><mo>_</mo></munder></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mn>1</mn></math></span> for every integer <span><math><mi>n</mi><mo>≥</mo><mn>0</mn></math></span>.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106007"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143099170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-07-01Epub Date: 2025-02-27DOI: 10.1016/j.jcta.2025.106025
Eiichi Bannai , Hirotake Kurihara , Da Zhao , Yan Zhu
The classification problem of P- and Q-polynomial association schemes has been one of the central problems in algebraic combinatorics. Generalizing the concept of P- and Q-polynomial association schemes to multivariate cases, namely to consider higher rank P- and Q-polynomial association schemes, has been tried by some authors, but it seems that so far there were neither very well-established definitions nor results. Very recently, Bernard, Crampé, d'Andecy, Vinet, and Zaimi [4], defined bivariate P-polynomial association schemes, as well as bivariate Q-polynomial association schemes. In this paper, we study these concepts and propose a new modified definition concerning a general monomial order, which is more general and more natural and also easy to handle. We prove that there are many interesting families of examples of multivariate P- and/or Q-polynomial association schemes.
{"title":"Multivariate P- and/or Q-polynomial association schemes","authors":"Eiichi Bannai , Hirotake Kurihara , Da Zhao , Yan Zhu","doi":"10.1016/j.jcta.2025.106025","DOIUrl":"10.1016/j.jcta.2025.106025","url":null,"abstract":"<div><div>The classification problem of <em>P</em>- and <em>Q</em>-polynomial association schemes has been one of the central problems in algebraic combinatorics. Generalizing the concept of <em>P</em>- and <em>Q</em>-polynomial association schemes to multivariate cases, namely to consider higher rank <em>P</em>- and <em>Q</em>-polynomial association schemes, has been tried by some authors, but it seems that so far there were neither very well-established definitions nor results. Very recently, Bernard, Crampé, d'Andecy, Vinet, and Zaimi <span><span>[4]</span></span>, defined bivariate <em>P</em>-polynomial association schemes, as well as bivariate <em>Q</em>-polynomial association schemes. In this paper, we study these concepts and propose a new modified definition concerning a general monomial order, which is more general and more natural and also easy to handle. We prove that there are many interesting families of examples of multivariate <em>P</em>- and/or <em>Q</em>-polynomial association schemes.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106025"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143510697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-07-01Epub Date: 2025-02-24DOI: 10.1016/j.jcta.2025.106020
Mircea Merca
<div><div>In 1920, Percy Alexander MacMahon defined the partition generating functions<span><span><span><math><mrow><msub><mrow><mi>A</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>)</mo><mo>:</mo><mo>=</mo><munder><mo>∑</mo><mrow><mn>0</mn><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo><</mo><mo>⋯</mo><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></munder><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup></mrow><mrow><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>⋯</mo><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow></mfrac></mrow></math></span></span></span> and<span><span><span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>)</mo><mo>:</mo><mo>=</mo><munder><mo>∑</mo><mrow><mn>0</mn><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo><</mo><mo>⋯</mo><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></munder><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>+</mo><mo>⋯</mo><mo>+</mo><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>−</mo><mi>k</mi></mrow></msup></mrow><mrow><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>⋯</mo><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow></mfrac></math></span></span></span> which have since played an important rol
1920 年,珀西-亚历山大-麦克马洪定义了分区生成函数 Ak(q):=∑0<n1<n2<⋯<nkqn1+n2+⋯+nk(1-qn1)2(1-qn2)2⋯(1-qnk)2 和 Ck(q):=∑0<n1<n2<⋯<nkq2n1+2n2+⋯+2nk-k(1-q2n1-1)2(1-q2n2-1)2⋯(1-q2nk-1)2,它们在组合数学中发挥了重要作用。对于每一个非负整数 k,乔治-安德鲁斯(George E. Andrews)和西蒙-罗斯(Simon C. F. Rose)证明了 Ak(q)可以用分区的生成函数来表示,其中每一部分可以用三种不同颜色中的一种来着色,而 Ck(q)可以用过分区的生成函数来表示。最近,对于每个非负整数 k,Ken Ono 和 Ajit Singh 证明了 Ak(q)、Ak+1(q)、Ak+2(q)......给出了每个部分可以用三种不同颜色中的一种着色的 n 的分区数的生成函数,而 Ck(q)、Ck+1(q)、Ck+2(q)......给出了 n 的过度分区数的生成函数。本文还介绍了一些悬而未决的问题。
{"title":"Truncated forms of MacMahon's q-series","authors":"Mircea Merca","doi":"10.1016/j.jcta.2025.106020","DOIUrl":"10.1016/j.jcta.2025.106020","url":null,"abstract":"<div><div>In 1920, Percy Alexander MacMahon defined the partition generating functions<span><span><span><math><mrow><msub><mrow><mi>A</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>)</mo><mo>:</mo><mo>=</mo><munder><mo>∑</mo><mrow><mn>0</mn><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo><</mo><mo>⋯</mo><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></munder><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup></mrow><mrow><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>⋯</mo><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow></mfrac></mrow></math></span></span></span> and<span><span><span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>)</mo><mo>:</mo><mo>=</mo><munder><mo>∑</mo><mrow><mn>0</mn><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo><</mo><mo>⋯</mo><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></munder><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>+</mo><mo>⋯</mo><mo>+</mo><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>−</mo><mi>k</mi></mrow></msup></mrow><mrow><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>⋯</mo><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow></mfrac></math></span></span></span> which have since played an important rol","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106020"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-07-01Epub Date: 2025-02-24DOI: 10.1016/j.jcta.2025.106022
Valentina Kiritchenko
We construct simple geometric operations on faces of the Cayley sum of two polytopes. These operations can be thought of as convex geometric counterparts of divided difference operators in Schubert calculus. We show that these operations give a uniform construction of Knutson–Miller mitosis in the type A and Fujita mitosis in the type C on Kogan faces of Gelfand–Zetlin polytopes.
{"title":"Simple geometric mitosis","authors":"Valentina Kiritchenko","doi":"10.1016/j.jcta.2025.106022","DOIUrl":"10.1016/j.jcta.2025.106022","url":null,"abstract":"<div><div>We construct simple geometric operations on faces of the Cayley sum of two polytopes. These operations can be thought of as convex geometric counterparts of divided difference operators in Schubert calculus. We show that these operations give a uniform construction of Knutson–Miller mitosis in the type <em>A</em> and Fujita mitosis in the type <em>C</em> on Kogan faces of Gelfand–Zetlin polytopes.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106022"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143474227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-07-01Epub Date: 2025-02-24DOI: 10.1016/j.jcta.2025.106026
Shkredov I.D.
We obtain a polynomial criterion for a set to have a small doubling in terms of the common energy of its subsets.
我们得到了一个多项式标准,即一个集合在其子集合的公共能量方面有一个小的加倍。
{"title":"On common energies and sumsets","authors":"Shkredov I.D.","doi":"10.1016/j.jcta.2025.106026","DOIUrl":"10.1016/j.jcta.2025.106026","url":null,"abstract":"<div><div>We obtain a polynomial criterion for a set to have a small doubling in terms of the common energy of its subsets.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106026"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143474228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-07-01Epub Date: 2025-01-20DOI: 10.1016/j.jcta.2025.106006
Xiaoran Wang, Junling Zhou
This paper concentrates on recursive constructions for 2-designs over finite fields. In 1998, Itoh presented a powerful recursive construction: for certain index λ, if there exists a Singer cycle invariant 2- design, then there also exists an SL invariant 2- design for all integers . We investigate the -incidence matrix between 2-subspaces and k-subspaces of with and in this work. As a generalization of Itoh's construction, the important case of is supplemented and a doubling construction is established for 2- designs over finite fields. As a further generalization, a product construction is developed for q-analogs of group divisible designs (q-GDDs). For general block dimension , several new infinite families of q-GDDs are constructed. As applications, plenty of new infinite families of 2-designs over finite fields are constructed.
{"title":"On recursive constructions for 2-designs over finite fields","authors":"Xiaoran Wang, Junling Zhou","doi":"10.1016/j.jcta.2025.106006","DOIUrl":"10.1016/j.jcta.2025.106006","url":null,"abstract":"<div><div>This paper concentrates on recursive constructions for 2-designs over finite fields. In 1998, Itoh presented a powerful recursive construction: for certain index <em>λ</em>, if there exists a Singer cycle invariant 2-<span><math><msub><mrow><mo>(</mo><mi>l</mi><mo>,</mo><mn>3</mn><mo>,</mo><mi>λ</mi><mo>)</mo></mrow><mrow><mi>q</mi></mrow></msub></math></span> design, then there also exists an SL<span><math><mo>(</mo><mi>m</mi><mo>,</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>l</mi></mrow></msup><mo>)</mo></math></span> invariant 2-<span><math><msub><mrow><mo>(</mo><mi>m</mi><mi>l</mi><mo>,</mo><mn>3</mn><mo>,</mo><mi>λ</mi><mo>)</mo></mrow><mrow><mi>q</mi></mrow></msub></math></span> design for all integers <span><math><mi>m</mi><mo>≥</mo><mn>3</mn></math></span>. We investigate the <span><math><mrow><mi>GL</mi></mrow><mo>(</mo><mi>m</mi><mo>,</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>l</mi></mrow></msup><mo>)</mo></math></span>-incidence matrix between 2-subspaces and <em>k</em>-subspaces of <span><math><mi>GF</mi><mspace></mspace><msup><mrow><mo>(</mo><mi>q</mi><mo>)</mo></mrow><mrow><mi>m</mi><mi>l</mi></mrow></msup></math></span> with <span><math><mi>m</mi><mo>≥</mo><mn>2</mn></math></span> and <span><math><mi>k</mi><mo>≥</mo><mn>3</mn></math></span> in this work. As a generalization of Itoh's construction, the important case of <span><math><mi>m</mi><mo>=</mo><mn>2</mn></math></span> is supplemented and a doubling construction is established for 2-<span><math><msub><mrow><mo>(</mo><mi>l</mi><mo>,</mo><mn>3</mn><mo>,</mo><mi>λ</mi><mo>)</mo></mrow><mrow><mi>q</mi></mrow></msub></math></span> designs over finite fields. As a further generalization, a product construction is developed for <em>q</em>-analogs of group divisible designs (<em>q</em>-GDDs). For general block dimension <span><math><mi>k</mi><mo>≥</mo><mn>3</mn></math></span>, several new infinite families of <em>q</em>-GDDs are constructed. As applications, plenty of new infinite families of 2-designs over finite fields are constructed.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106006"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143103356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-07-01Epub Date: 2025-02-24DOI: 10.1016/j.jcta.2025.106024
Zhenxian Chen , Changchang Xi
We show that the Terwilliger algebra of a quasi-thin association scheme over a field is always a quasi-hereditary cellular algebra in the sense of Cline-Parshall-Scott and of Graham-Lehrer, respectively, and that the basic algebra of the Terwilliger algebra is the dual extension of a star with all arrows pointing to its center if the field has characteristic 2. Thus many homological and representation-theoretic properties of these Terwilliger algebras can be determined completely. For example, the Nakayama conjecture holds true for Terwilliger algebras of quasi-thin association schemes.
{"title":"Structure of Terwilliger algebras of quasi-thin association schemes","authors":"Zhenxian Chen , Changchang Xi","doi":"10.1016/j.jcta.2025.106024","DOIUrl":"10.1016/j.jcta.2025.106024","url":null,"abstract":"<div><div>We show that the Terwilliger algebra of a quasi-thin association scheme over a field is always a quasi-hereditary cellular algebra in the sense of Cline-Parshall-Scott and of Graham-Lehrer, respectively, and that the basic algebra of the Terwilliger algebra is the dual extension of a star with all arrows pointing to its center if the field has characteristic 2. Thus many homological and representation-theoretic properties of these Terwilliger algebras can be determined completely. For example, the Nakayama conjecture holds true for Terwilliger algebras of quasi-thin association schemes.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106024"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-07-01Epub Date: 2025-02-25DOI: 10.1016/j.jcta.2025.106029
Maarten De Boeck , Jozefien D'haeseleer , Morgan Rodgers
Cameron-Liebler sets of generators in polar spaces were introduced a few years ago as natural generalisations of the Cameron-Liebler sets of subspaces in projective spaces. In this article we present the first two constructions of non-trivial Cameron-Liebler sets of generators in polar spaces. Also regular m-ovoids of k-spaces are introduced as a generalization of m-ovoids of polar spaces. They are used in one of the aforementioned constructions of Cameron-Liebler sets.
极空间中的卡梅隆-利伯勒生成器集是几年前作为投影空间中子空间的卡梅隆-利伯勒集的自然广义而提出的。在这篇文章中,我们首次提出了极空间中非难卡梅隆-利伯勒生成器集的两个构造。此外,还介绍了 k 空间的正则 m-ovoids 作为极空间 m-ovoids 的广义。它们被用于上述卡梅隆-利伯勒集合的一个构造中。
{"title":"Regular ovoids and Cameron-Liebler sets of generators in polar spaces","authors":"Maarten De Boeck , Jozefien D'haeseleer , Morgan Rodgers","doi":"10.1016/j.jcta.2025.106029","DOIUrl":"10.1016/j.jcta.2025.106029","url":null,"abstract":"<div><div>Cameron-Liebler sets of generators in polar spaces were introduced a few years ago as natural generalisations of the Cameron-Liebler sets of subspaces in projective spaces. In this article we present the first two constructions of non-trivial Cameron-Liebler sets of generators in polar spaces. Also regular <em>m</em>-ovoids of <em>k</em>-spaces are introduced as a generalization of <em>m</em>-ovoids of polar spaces. They are used in one of the aforementioned constructions of Cameron-Liebler sets.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106029"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-05-01Epub Date: 2024-12-18DOI: 10.1016/j.jcta.2024.106000
Gabe Cunningham , Elías Mochán , Antonio Montero
A map on a surface whose automorphism group has a subgroup acting regularly on its vertices is called a Cayley map. Here we generalize that notion to maniplexes and polytopes. We define to be a Cayley extension of if the facets of are isomorphic to and if some subgroup of the automorphism group of acts regularly on the facets of . We show that many natural extensions in the literature on maniplexes and polytopes are in fact Cayley extensions. We also describe several universal Cayley extensions. Finally, we examine the automorphism group and symmetry type graph of Cayley extensions.
{"title":"Cayley extensions of maniplexes and polytopes","authors":"Gabe Cunningham , Elías Mochán , Antonio Montero","doi":"10.1016/j.jcta.2024.106000","DOIUrl":"10.1016/j.jcta.2024.106000","url":null,"abstract":"<div><div>A map on a surface whose automorphism group has a subgroup acting regularly on its vertices is called a Cayley map. Here we generalize that notion to maniplexes and polytopes. We define <span><math><mi>M</mi></math></span> to be a <em>Cayley extension</em> of <span><math><mi>K</mi></math></span> if the facets of <span><math><mi>M</mi></math></span> are isomorphic to <span><math><mi>K</mi></math></span> and if some subgroup of the automorphism group of <span><math><mi>M</mi></math></span> acts regularly on the facets of <span><math><mi>M</mi></math></span>. We show that many natural extensions in the literature on maniplexes and polytopes are in fact Cayley extensions. We also describe several universal Cayley extensions. Finally, we examine the automorphism group and symmetry type graph of Cayley extensions.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"212 ","pages":"Article 106000"},"PeriodicalIF":0.9,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143095348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-05-01Epub Date: 2024-12-19DOI: 10.1016/j.jcta.2024.106001
Gábor P. Nagy
The vectorial nonlinearity of a vector-valued function is its distance from the set of affine functions. In 2017, Liu, Mesnager, and Chen conjectured a general upper bound for the vectorial linearity. Recently, Carlet established a lower bound in terms of differential uniformity. In this paper, we improve Carlet's lower bound. Our approach is based on the fact that the level sets of a vectorial Boolean function are thin sets. In particular, level sets of APN functions are Sidon sets, hence the Liu-Mesnager-Chen conjecture predicts that in , there should be Sidon sets of size at least for all n. This paper provides an overview of the known large Sidon sets in , and examines the completeness of the large Sidon sets derived from hyperbolas and ellipses of the finite affine plane.
{"title":"Sidon sets, thin sets, and the nonlinearity of vectorial Boolean functions","authors":"Gábor P. Nagy","doi":"10.1016/j.jcta.2024.106001","DOIUrl":"10.1016/j.jcta.2024.106001","url":null,"abstract":"<div><div>The vectorial nonlinearity of a vector-valued function is its distance from the set of affine functions. In 2017, Liu, Mesnager, and Chen conjectured a general upper bound for the vectorial linearity. Recently, Carlet established a lower bound in terms of differential uniformity. In this paper, we improve Carlet's lower bound. Our approach is based on the fact that the level sets of a vectorial Boolean function are thin sets. In particular, level sets of APN functions are Sidon sets, hence the Liu-Mesnager-Chen conjecture predicts that in <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msubsup></math></span>, there should be Sidon sets of size at least <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi><mo>/</mo><mn>2</mn></mrow></msup><mo>+</mo><mn>1</mn></math></span> for all <em>n</em>. This paper provides an overview of the known large Sidon sets in <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msubsup></math></span>, and examines the completeness of the large Sidon sets derived from hyperbolas and ellipses of the finite affine plane.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"212 ","pages":"Article 106001"},"PeriodicalIF":0.9,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142874013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}