{"title":"On recursive constructions for 2-designs over finite fields","authors":"Xiaoran Wang, Junling Zhou","doi":"10.1016/j.jcta.2025.106006","DOIUrl":null,"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.9000,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316525000019","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
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.
期刊介绍:
The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.