James A. Davis, John Polhill, Ken Smith, Eric Swartz, Jordan Webster
{"title":"New spence difference sets","authors":"James A. Davis, John Polhill, Ken Smith, Eric Swartz, Jordan Webster","doi":"10.1007/s10623-024-01446-2","DOIUrl":null,"url":null,"abstract":"<p>Spence [9] constructed <span>\\(\\left( \\frac{3^{d+1}(3^{d+1}-1)}{2}, \\frac{3^d(3^{d+1}+1)}{2}, \\frac{3^d(3^d+1)}{2}\\right) \\)</span>-difference sets in groups <span>\\(K \\times C_3^{d+1}\\)</span> for <i>d</i> any positive integer and <i>K</i> any group of order <span>\\(\\frac{3^{d+1}-1}{2}\\)</span>. Smith and Webster [8] have exhaustively studied the <span>\\(d=1\\)</span> case without requiring that the group have the form listed above and found many constructions. Among these, one intriguing example constructs Spence difference sets in <span>\\(A_4 \\times C_3\\)</span> by using (3, 3, 3, 1)-relative difference sets in a non-normal subgroup isomorphic to <span>\\(C_3^2\\)</span>. Drisko [3] has a note implying that his techniques allow constructions of Spence difference sets in groups with a noncentral normal subgroup isomorphic to <span>\\(C_3^{d+1}\\)</span> as long as <span>\\(\\frac{3^{d+1}-1}{2}\\)</span> is a prime power. We generalize this result by constructing Spence difference sets in similar families of groups, but we drop the requirement that <span>\\(\\frac{3^{d+1}-1}{2}\\)</span> is a prime power. We conjecture that any group of order <span>\\(\\frac{3^{d+1}(3^{d+1}-1)}{2}\\)</span> with a normal subgroup isomorphic to <span>\\(C_3^{d+1}\\)</span> will have a Spence difference set (this is analogous to Dillon’s conjecture in 2-groups, and that result was proved in Drisko’s work). Finally, we present the first known example of a Spence difference set in a group where the Sylow 3-subgroup is nonabelian and has exponent bigger than 3. This new construction, found by computing the full automorphism group <span>\\(\\textrm{Aut}(\\mathcal {D})\\)</span> of a symmetric design associated to a known Spence difference set and identifying a regular subgroup of <span>\\(\\textrm{Aut}(\\mathcal {D})\\)</span>, uses (3, 3, 3, 1)-relative difference sets to describe the difference set.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"31 1","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01446-2","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Spence [9] constructed \(\left( \frac{3^{d+1}(3^{d+1}-1)}{2}, \frac{3^d(3^{d+1}+1)}{2}, \frac{3^d(3^d+1)}{2}\right) \)-difference sets in groups \(K \times C_3^{d+1}\) for d any positive integer and K any group of order \(\frac{3^{d+1}-1}{2}\). Smith and Webster [8] have exhaustively studied the \(d=1\) case without requiring that the group have the form listed above and found many constructions. Among these, one intriguing example constructs Spence difference sets in \(A_4 \times C_3\) by using (3, 3, 3, 1)-relative difference sets in a non-normal subgroup isomorphic to \(C_3^2\). Drisko [3] has a note implying that his techniques allow constructions of Spence difference sets in groups with a noncentral normal subgroup isomorphic to \(C_3^{d+1}\) as long as \(\frac{3^{d+1}-1}{2}\) is a prime power. We generalize this result by constructing Spence difference sets in similar families of groups, but we drop the requirement that \(\frac{3^{d+1}-1}{2}\) is a prime power. We conjecture that any group of order \(\frac{3^{d+1}(3^{d+1}-1)}{2}\) with a normal subgroup isomorphic to \(C_3^{d+1}\) will have a Spence difference set (this is analogous to Dillon’s conjecture in 2-groups, and that result was proved in Drisko’s work). Finally, we present the first known example of a Spence difference set in a group where the Sylow 3-subgroup is nonabelian and has exponent bigger than 3. This new construction, found by computing the full automorphism group \(\textrm{Aut}(\mathcal {D})\) of a symmetric design associated to a known Spence difference set and identifying a regular subgroup of \(\textrm{Aut}(\mathcal {D})\), uses (3, 3, 3, 1)-relative difference sets to describe the difference set.
期刊介绍:
Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines.
The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome.
The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas.
Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.