Pub Date : 2024-04-26DOI: 10.1016/j.jcta.2024.105906
Boheng Huang
A group code is a linear code which can be realized as a two-sided ideal of a group algebra over a finite field. When the characteristic of the field is prime to the order of the group, we will give explicit expressions for primitive central idempotents in the group algebra, which enables us to determine the number of equivalent classes of minimal group codes. Then, we apply our formula to calculate the number of equivalent classes of minimal general dihedral group codes.
{"title":"The enumeration of equivalent classes of minimal general dihedral group codes","authors":"Boheng Huang","doi":"10.1016/j.jcta.2024.105906","DOIUrl":"https://doi.org/10.1016/j.jcta.2024.105906","url":null,"abstract":"<div><p>A group code is a linear code which can be realized as a two-sided ideal of a group algebra over a finite field. When the characteristic of the field is prime to the order of the group, we will give explicit expressions for primitive central idempotents in the group algebra, which enables us to determine the number of equivalent classes of minimal group codes. Then, we apply our formula to calculate the number of equivalent classes of minimal general dihedral group codes.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"206 ","pages":"Article 105906"},"PeriodicalIF":1.1,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140649718","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 : 2024-04-22DOI: 10.1016/j.jcta.2024.105904
Karel Klouda, Štěpán Starosta
Let H be an HD0L-system. We show that there are only finitely many primitive words v with the property that , for all integers k, is an element of the factorial language of H. In particular, this result applies to the set of all factors of a morphic word. We provide a formalized proof in the proof assistant Isabelle/HOL as part of the Combinatorics on Words Formalized project.
设 H 是一个 HD0L 系统。我们证明,对于所有整数 k,只有有限多个原始词 v 具有这样的性质:vk 是 H 的因子语言的一个元素。我们在证明助手 Isabelle/HOL 中提供了形式化证明,这是词上组合论形式化项目的一部分。
{"title":"The number of primitive words of unbounded exponent in the language of an HD0L-system is finite","authors":"Karel Klouda, Štěpán Starosta","doi":"10.1016/j.jcta.2024.105904","DOIUrl":"https://doi.org/10.1016/j.jcta.2024.105904","url":null,"abstract":"<div><p>Let <em>H</em> be an HD0L-system. We show that there are only finitely many primitive words <em>v</em> with the property that <span><math><msup><mrow><mi>v</mi></mrow><mrow><mi>k</mi></mrow></msup></math></span>, for all integers <em>k</em>, is an element of the factorial language of <em>H</em>. In particular, this result applies to the set of all factors of a morphic word. We provide a formalized proof in the proof assistant Isabelle/HOL as part of the Combinatorics on Words Formalized project.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"206 ","pages":"Article 105904"},"PeriodicalIF":1.1,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140633182","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 : 2024-04-17DOI: 10.1016/j.jcta.2024.105895
Nemanja Poznanović , Cheryl E. Praeger
Let denote the family of all graph-group pairs where Γ is finite, 4-valent, connected, and G-oriented (G-half-arc-transitive). A subfamily of has recently been identified as ‘basic’ in the sense that all graphs in this family are normal covers of at least one basic member. In this paper we provide a description of such basic pairs which have at least one G-normal quotient which is isomorphic to a cycle graph. In doing so, we produce many new infinite families of examples and solve several problems posed in the recent literature on this topic. This result completes a research project aiming to provide a description of all basic pairs in .
让 OG(4) 表示所有图-群对(Γ,G)的族,其中Γ 是有限的、四价的、连通的和面向 G 的(G-半弧-传递性)。最近,OG(4)的一个子族被认定为 "基本 "族,因为该族中的所有图都是至少一个基本成员的法向盖。在本文中,我们描述了至少有一个 G 常商数与循环图同构的基本图对。在此过程中,我们产生了许多新的无穷族实例,并解决了最近有关这一主题的文献中提出的几个问题。这一成果完成了一个旨在描述 OG(4) 中所有基本对的研究项目。
{"title":"Basic tetravalent oriented graphs with cyclic normal quotients","authors":"Nemanja Poznanović , Cheryl E. Praeger","doi":"10.1016/j.jcta.2024.105895","DOIUrl":"https://doi.org/10.1016/j.jcta.2024.105895","url":null,"abstract":"<div><p>Let <span><math><mi>OG</mi><mo>(</mo><mn>4</mn><mo>)</mo></math></span> denote the family of all graph-group pairs <span><math><mo>(</mo><mi>Γ</mi><mo>,</mo><mi>G</mi><mo>)</mo></math></span> where Γ is finite, 4-valent, connected, and <em>G</em>-oriented (<em>G</em>-half-arc-transitive). A subfamily of <span><math><mi>OG</mi><mo>(</mo><mn>4</mn><mo>)</mo></math></span> has recently been identified as ‘basic’ in the sense that all graphs in this family are normal covers of at least one basic member. In this paper we provide a description of such basic pairs which have at least one <em>G</em>-normal quotient which is isomorphic to a cycle graph. In doing so, we produce many new infinite families of examples and solve several problems posed in the recent literature on this topic. This result completes a research project aiming to provide a description of all basic pairs in <span><math><mi>OG</mi><mo>(</mo><mn>4</mn><mo>)</mo></math></span>.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"206 ","pages":"Article 105895"},"PeriodicalIF":1.1,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097316524000347/pdfft?md5=f4ddc34a4bd5053c5b3e0115d6f19233&pid=1-s2.0-S0097316524000347-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140558761","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 : 2024-04-17DOI: 10.1016/j.jcta.2024.105905
Zi-Wei Bai, Ricky X.F. Chen
Enumeration of hypermaps (or Grothendieck's dessins d'enfants) is widely studied in many fields. In particular, enumerating hypermaps with a fixed edge-type according to the number of faces and genus is one topic of great interest. The first systematic study of hypermaps with one face and any fixed edge-type is the work of Jackson (1987) [23] using group characters. Stanley later (2011) obtained the genus distribution polynomial of one-face hypermaps of any fixed edge-type expressed in terms of the backward shift operator. There is also enormous amount of work on enumerating one-face hypermaps of specific edge-types. Hypermaps with more faces are generally much harder to enumerate and results are rare. Our main results here are formulas for the genus distribution polynomials for a family of typical two-face hypermaps including almost all edge-types, the purely imaginary zeros property of these polynomials, and the log-concavity of the coefficients.
{"title":"Explicit formulas for a family of hypermaps beyond the one-face case","authors":"Zi-Wei Bai, Ricky X.F. Chen","doi":"10.1016/j.jcta.2024.105905","DOIUrl":"https://doi.org/10.1016/j.jcta.2024.105905","url":null,"abstract":"<div><p>Enumeration of hypermaps (or Grothendieck's dessins d'enfants) is widely studied in many fields. In particular, enumerating hypermaps with a fixed edge-type according to the number of faces and genus is one topic of great interest. The first systematic study of hypermaps with one face and any fixed edge-type is the work of Jackson (1987) <span>[23]</span> using group characters. Stanley later (2011) obtained the genus distribution polynomial of one-face hypermaps of any fixed edge-type expressed in terms of the backward shift operator. There is also enormous amount of work on enumerating one-face hypermaps of specific edge-types. Hypermaps with more faces are generally much harder to enumerate and results are rare. Our main results here are formulas for the genus distribution polynomials for a family of typical two-face hypermaps including almost all edge-types, the purely imaginary zeros property of these polynomials, and the log-concavity of the coefficients.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"206 ","pages":"Article 105905"},"PeriodicalIF":1.1,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140604786","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 : 2024-04-15DOI: 10.1016/j.jcta.2024.105903
Olivia X.M. Yao
In 2012, Andrews and Merca proved a truncated theorem on Euler's pentagonal number theorem. Their work has opened up a new study of truncated series. Recently, Ballantine and Merca posed a conjecture on infinite families of inequalities involving , which counts the number of 6-regular partitions of n. In this paper, we confirm Ballantine and Merca's conjecture on linear equalities of based on a formula of the number of partitions of n into parts not exceeding 3 due to Cayley.
{"title":"Proof of a conjecture of Ballantine and Merca on truncated sums of 6-regular partitions","authors":"Olivia X.M. Yao","doi":"10.1016/j.jcta.2024.105903","DOIUrl":"https://doi.org/10.1016/j.jcta.2024.105903","url":null,"abstract":"<div><p>In 2012, Andrews and Merca proved a truncated theorem on Euler's pentagonal number theorem. Their work has opened up a new study of truncated series. Recently, Ballantine and Merca posed a conjecture on infinite families of inequalities involving <span><math><msub><mrow><mi>b</mi></mrow><mrow><mn>6</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span>, which counts the number of 6-regular partitions of <em>n</em>. In this paper, we confirm Ballantine and Merca's conjecture on linear equalities of <span><math><msub><mrow><mi>b</mi></mrow><mrow><mn>6</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> based on a formula of the number of partitions of <em>n</em> into parts not exceeding 3 due to Cayley.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"206 ","pages":"Article 105903"},"PeriodicalIF":1.1,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140554335","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}
In this article, we study 2-designs with admitting a flag-transitive and point-primitive almost simple automorphism group G with socle X a finite simple classical group of Lie type. We prove that such a design belongs to an infinite family of 2-designs with parameter set and for some , or with point-stabiliser , or it is isomorphic to the 2-design with parameter set , , , , , , or .
{"title":"Classical groups as flag-transitive automorphism groups of 2-designs with λ = 2","authors":"Seyed Hassan Alavi , Mohsen Bayat , Ashraf Daneshkhah , Marjan Tadbirinia","doi":"10.1016/j.jcta.2024.105892","DOIUrl":"https://doi.org/10.1016/j.jcta.2024.105892","url":null,"abstract":"<div><p>In this article, we study 2-designs with <span><math><mi>λ</mi><mo>=</mo><mn>2</mn></math></span> admitting a flag-transitive and point-primitive almost simple automorphism group <em>G</em> with socle <em>X</em> a finite simple classical group of Lie type. We prove that such a design belongs to an infinite family of 2-designs with parameter set <span><math><mo>(</mo><mo>(</mo><msup><mrow><mn>3</mn></mrow><mrow><mi>n</mi></mrow></msup><mo>−</mo><mn>1</mn><mo>)</mo><mo>/</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span> and <span><math><mi>X</mi><mo>=</mo><msub><mrow><mi>PSL</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><mn>3</mn><mo>)</mo></math></span> for some <span><math><mi>n</mi><mo>⩾</mo><mn>3</mn></math></span>, or <span><math><mi>X</mi><mo>=</mo><msub><mrow><mi>PSL</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mi>q</mi><mo>)</mo></math></span> with point-stabiliser <span><math><msub><mrow><mi>D</mi></mrow><mrow><mn>2</mn><mo>(</mo><mi>q</mi><mo>+</mo><mn>1</mn><mo>)</mo><mo>/</mo><mi>gcd</mi><mo></mo><mo>(</mo><mn>2</mn><mo>,</mo><mi>q</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow></msub></math></span>, or it is isomorphic to the 2-design with parameter set <span><math><mo>(</mo><mn>6</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span>, <span><math><mo>(</mo><mn>7</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span>, <span><math><mo>(</mo><mn>10</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span>, <span><math><mo>(</mo><mn>11</mn><mo>,</mo><mn>5</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span>, <span><math><mo>(</mo><mn>28</mn><mo>,</mo><mn>7</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span>, <span><math><mo>(</mo><mn>28</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span>, <span><math><mo>(</mo><mn>36</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span> or <span><math><mo>(</mo><mn>126</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span>.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"206 ","pages":"Article 105892"},"PeriodicalIF":1.1,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140546056","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 : 2024-04-10DOI: 10.1016/j.jcta.2024.105894
Stepan Konenkov
We examine four identities conjectured by Dean Hickerson which complement five modulo 9 Kanade–Russell identities, and we build up a profile of new identities and new conjectures similar to those found by Ali Uncu and Wadim Zudilin.
{"title":"Further q-reflections on the modulo 9 Kanade–Russell (conjectural) identities","authors":"Stepan Konenkov","doi":"10.1016/j.jcta.2024.105894","DOIUrl":"https://doi.org/10.1016/j.jcta.2024.105894","url":null,"abstract":"<div><p>We examine four identities conjectured by Dean Hickerson which complement five modulo 9 Kanade–Russell identities, and we build up a profile of new identities and new conjectures similar to those found by Ali Uncu and Wadim Zudilin.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"206 ","pages":"Article 105894"},"PeriodicalIF":1.1,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140540286","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 : 2024-04-04DOI: 10.1016/j.jcta.2024.105891
Lilla Tóthmérész
We define the root polytope of a regular oriented matroid, and show that the greedoid polynomial of an Eulerian branching greedoid rooted at vertex is equivalent to the -polynomial of the root polytope of the dual of the graphic matroid.
As the definition of the root polytope is independent of the vertex , this gives a geometric proof for the root-independence of the greedoid polynomial for Eulerian branching greedoids, a fact which was first proved by Swee Hong Chan, Kévin Perrot and Trung Van Pham using sandpile models. We also obtain that the greedoid polynomial does not change if we reverse every edge of an Eulerian digraph.
我们定义了正则定向 matroid 的根多胞形,并证明了以顶点 v0 为根的欧拉分支 greedoid 的 greedoid 多项式等价于图形 matroid 对偶的根多胞形的⁎-多项式。由于根多胞形的定义与顶点 v0 无关,这就给出了欧拉分支 greedoid 多项式与根无关的几何证明,而这一事实最早是由 Swee Hong Chan、Kévin Perrot 和 Trung Van Pham 利用沙堆模型证明的。我们还得出,如果我们将欧拉图的每条边反转,greedoid 多项式也不会发生变化。
{"title":"A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids","authors":"Lilla Tóthmérész","doi":"10.1016/j.jcta.2024.105891","DOIUrl":"https://doi.org/10.1016/j.jcta.2024.105891","url":null,"abstract":"<div><p>We define the root polytope of a regular oriented matroid, and show that the greedoid polynomial of an Eulerian branching greedoid rooted at vertex <span><math><msub><mrow><mi>v</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span> is equivalent to the <span><math><msup><mrow><mi>h</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span>-polynomial of the root polytope of the dual of the graphic matroid.</p><p>As the definition of the root polytope is independent of the vertex <span><math><msub><mrow><mi>v</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span>, this gives a geometric proof for the root-independence of the greedoid polynomial for Eulerian branching greedoids, a fact which was first proved by Swee Hong Chan, Kévin Perrot and Trung Van Pham using sandpile models. We also obtain that the greedoid polynomial does not change if we reverse every edge of an Eulerian digraph.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"206 ","pages":"Article 105891"},"PeriodicalIF":1.1,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S009731652400030X/pdfft?md5=24b6ae0df2f0ec32e3f3bfc6f52f2e2c&pid=1-s2.0-S009731652400030X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140347134","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 : 2024-04-03DOI: 10.1016/j.jcta.2024.105890
Chenya Zhao , Binwei Zhao , Yanxun Chang , Tao Feng , Xiaomiao Wang , Menglong Zhang
<div><p>Given a subgroup <em>H</em> of a group <span><math><mo>(</mo><mi>G</mi><mo>,</mo><mo>+</mo><mo>)</mo></math></span>, a <span><math><mo>(</mo><mi>G</mi><mo>,</mo><mi>H</mi><mo>,</mo><mi>k</mi><mo>,</mo><mn>1</mn><mo>)</mo></math></span> difference family (DF) is a set <span><math><mi>F</mi></math></span> of <em>k</em>-subsets of <em>G</em> such that <span><math><mo>{</mo><mi>f</mi><mo>−</mo><msup><mrow><mi>f</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>:</mo><mi>f</mi><mo>,</mo><msup><mrow><mi>f</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>∈</mo><mi>F</mi><mo>,</mo><mi>f</mi><mo>≠</mo><msup><mrow><mi>f</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>,</mo><mi>F</mi><mo>∈</mo><mi>F</mi><mo>}</mo><mo>=</mo><mi>G</mi><mo>∖</mo><mi>H</mi></math></span>. Let <span><math><mi>g</mi><msub><mrow><mi>Z</mi></mrow><mrow><mi>g</mi><mi>h</mi></mrow></msub></math></span> be the subgroup of order <em>h</em> in <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>g</mi><mi>h</mi></mrow></msub></math></span> generated by <em>g</em>. A <span><math><mo>(</mo><msub><mrow><mi>Z</mi></mrow><mrow><mi>g</mi><mi>h</mi></mrow></msub><mo>,</mo><mi>g</mi><msub><mrow><mi>Z</mi></mrow><mrow><mi>g</mi><mi>h</mi></mrow></msub><mo>,</mo><mi>k</mi><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-DF is called cyclic and written as a <span><math><mo>(</mo><mi>g</mi><mi>h</mi><mo>,</mo><mi>h</mi><mo>,</mo><mi>k</mi><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-CDF. This paper shows that for <span><math><mi>h</mi><mo>∈</mo><mo>{</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>}</mo></math></span>, there exists a <span><math><mo>(</mo><mi>g</mi><mi>h</mi><mo>,</mo><mi>h</mi><mo>,</mo><mn>4</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-CDF if and only if <span><math><mi>g</mi><mi>h</mi><mo>≡</mo><mi>h</mi><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mn>12</mn><mo>)</mo></math></span>, <span><math><mi>g</mi><mo>⩾</mo><mn>4</mn></math></span> and <span><math><mo>(</mo><mi>g</mi><mo>,</mo><mi>h</mi><mo>)</mo><mo>∉</mo><mo>{</mo><mo>(</mo><mn>9</mn><mo>,</mo><mn>3</mn><mo>)</mo><mo>,</mo><mo>(</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>)</mo><mo>}</mo></math></span>. As a corollary, it is shown that a 1-rotational Steiner system S<span><math><mo>(</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mi>v</mi><mo>)</mo></math></span> exists if and only if <span><math><mi>v</mi><mo>≡</mo><mn>4</mn><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mn>12</mn><mo>)</mo></math></span> and <span><math><mi>v</mi><mo>≠</mo><mn>28</mn></math></span>. This solves the long-standing open problem on the existence of a 1-rotational S<span><math><mo>(</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mi>v</mi><mo>)</mo></math></span>. As another corollary, we establish the existence of an optimal <span><math><mo>(</mo><mi>v</mi><mo>,</mo><mn>4</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-optical orthogonal code with <span><math><mo>⌊</mo><mo>(</mo><mi>v</mi><mo>−</
给定一个群(G,+)的子群 H,一个(G,H,k,1)差族(DF)是 G 的 k 个子集的集合 F,使得 {f-f′:f,f′∈F,f≠f′,F∈F}=G∖H。设 gZgh 是 g 在 Zgh 中产生的阶为 h 的子群。(Zgh,gZgh,k,1)-DF 称为循环DF,并写成 (gh,h,k,1)-CDF。本文指出,对于 h∈{2,3,6},当且仅当 gh≡h(mod12),g⩾4 且 (g,h)∉{(9,3),(5,6)} 时,存在一个 (gh,h,4,1)-CDF 。推论表明,当且仅当 v≡4(mod12)且 v≠28 时,存在一个 1 旋转的斯坦纳系统 S(2,4,v)。这就解决了存在 1- 旋转 S(2,4,v) 这一长期悬而未决的问题。作为另一个推论,我们确定了对于任意正整数 v≡1,2,3,4,6(mod12)和 v≠25,存在一个具有⌊(v-1)/12⌋码字的最优 (v,4,1) 光正交码。我们还给出了我们的结果在块大小为四的循环群可分设计和权重为四且最小距离为六的最优循环三元恒权码中的应用。
{"title":"Cyclic relative difference families with block size four and their applications","authors":"Chenya Zhao , Binwei Zhao , Yanxun Chang , Tao Feng , Xiaomiao Wang , Menglong Zhang","doi":"10.1016/j.jcta.2024.105890","DOIUrl":"https://doi.org/10.1016/j.jcta.2024.105890","url":null,"abstract":"<div><p>Given a subgroup <em>H</em> of a group <span><math><mo>(</mo><mi>G</mi><mo>,</mo><mo>+</mo><mo>)</mo></math></span>, a <span><math><mo>(</mo><mi>G</mi><mo>,</mo><mi>H</mi><mo>,</mo><mi>k</mi><mo>,</mo><mn>1</mn><mo>)</mo></math></span> difference family (DF) is a set <span><math><mi>F</mi></math></span> of <em>k</em>-subsets of <em>G</em> such that <span><math><mo>{</mo><mi>f</mi><mo>−</mo><msup><mrow><mi>f</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>:</mo><mi>f</mi><mo>,</mo><msup><mrow><mi>f</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>∈</mo><mi>F</mi><mo>,</mo><mi>f</mi><mo>≠</mo><msup><mrow><mi>f</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>,</mo><mi>F</mi><mo>∈</mo><mi>F</mi><mo>}</mo><mo>=</mo><mi>G</mi><mo>∖</mo><mi>H</mi></math></span>. Let <span><math><mi>g</mi><msub><mrow><mi>Z</mi></mrow><mrow><mi>g</mi><mi>h</mi></mrow></msub></math></span> be the subgroup of order <em>h</em> in <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>g</mi><mi>h</mi></mrow></msub></math></span> generated by <em>g</em>. A <span><math><mo>(</mo><msub><mrow><mi>Z</mi></mrow><mrow><mi>g</mi><mi>h</mi></mrow></msub><mo>,</mo><mi>g</mi><msub><mrow><mi>Z</mi></mrow><mrow><mi>g</mi><mi>h</mi></mrow></msub><mo>,</mo><mi>k</mi><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-DF is called cyclic and written as a <span><math><mo>(</mo><mi>g</mi><mi>h</mi><mo>,</mo><mi>h</mi><mo>,</mo><mi>k</mi><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-CDF. This paper shows that for <span><math><mi>h</mi><mo>∈</mo><mo>{</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>}</mo></math></span>, there exists a <span><math><mo>(</mo><mi>g</mi><mi>h</mi><mo>,</mo><mi>h</mi><mo>,</mo><mn>4</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-CDF if and only if <span><math><mi>g</mi><mi>h</mi><mo>≡</mo><mi>h</mi><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mn>12</mn><mo>)</mo></math></span>, <span><math><mi>g</mi><mo>⩾</mo><mn>4</mn></math></span> and <span><math><mo>(</mo><mi>g</mi><mo>,</mo><mi>h</mi><mo>)</mo><mo>∉</mo><mo>{</mo><mo>(</mo><mn>9</mn><mo>,</mo><mn>3</mn><mo>)</mo><mo>,</mo><mo>(</mo><mn>5</mn><mo>,</mo><mn>6</mn><mo>)</mo><mo>}</mo></math></span>. As a corollary, it is shown that a 1-rotational Steiner system S<span><math><mo>(</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mi>v</mi><mo>)</mo></math></span> exists if and only if <span><math><mi>v</mi><mo>≡</mo><mn>4</mn><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mn>12</mn><mo>)</mo></math></span> and <span><math><mi>v</mi><mo>≠</mo><mn>28</mn></math></span>. This solves the long-standing open problem on the existence of a 1-rotational S<span><math><mo>(</mo><mn>2</mn><mo>,</mo><mn>4</mn><mo>,</mo><mi>v</mi><mo>)</mo></math></span>. As another corollary, we establish the existence of an optimal <span><math><mo>(</mo><mi>v</mi><mo>,</mo><mn>4</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-optical orthogonal code with <span><math><mo>⌊</mo><mo>(</mo><mi>v</mi><mo>−</","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"206 ","pages":"Article 105890"},"PeriodicalIF":1.1,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140342255","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 : 2024-04-03DOI: 10.1016/j.jcta.2024.105893
Ping Li
We examine the coefficients in front of Chern numbers for complex genera, and pay special attention to the -genus, the Γ-genus as well as the Todd genus. Some related geometric applications to hyper-Kähler and Calabi-Yau manifolds are discussed. Along this line and building on the work of Doubilet in 1970s, various Hoffman-type formulas for multiple-(star) zeta values and transition matrices among canonical bases of the ring of symmetric functions can be uniformly treated in a more general framework.
{"title":"The complex genera, symmetric functions and multiple zeta values","authors":"Ping Li","doi":"10.1016/j.jcta.2024.105893","DOIUrl":"https://doi.org/10.1016/j.jcta.2024.105893","url":null,"abstract":"<div><p>We examine the coefficients in front of Chern numbers for complex genera, and pay special attention to the <span><math><msup><mrow><mtext>Td</mtext></mrow><mrow><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></msup></math></span>-genus, the Γ-genus as well as the Todd genus. Some related geometric applications to hyper-Kähler and Calabi-Yau manifolds are discussed. Along this line and building on the work of Doubilet in 1970s, various Hoffman-type formulas for multiple-(star) zeta values and transition matrices among canonical bases of the ring of symmetric functions can be uniformly treated in a more general framework.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"206 ","pages":"Article 105893"},"PeriodicalIF":1.1,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140344380","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}