New spence difference sets

IF 1.2 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-07-10 DOI:10.1007/s10623-024-01446-2
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.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
新的斯彭斯差异套装
Spence [9]构建了(left( (frac{3^{d+1}(3^{d+1}-1)}{2}, (frac{3^d(3^{d+1}+1)}{2}、\对于 d 为任意正整数,K 为任意阶为 \(\frac{3^{d+1}-1}{2}\)的群(K \times C_3^{d+1})中的差集。史密斯和韦伯斯特[8]详尽地研究了 \(d=1\) 的情况,而不要求群具有上述形式,并发现了许多构造。其中,一个有趣的例子是通过在与\(C_3^2\)同构的非正态子群中使用(3, 3, 3, 1)相关差集来构造\(A_4 \times C_3\)中的斯宾塞差集。Drisko [3] 有一个注释暗示,只要 \(\frac{3^{d+1}-1}{2}\) 是一个素幂,他的技术就可以在具有与 \(C_3^{d+1}) 同构的非中心正态子群的群中构造斯宾塞差集。我们通过在类似的群族中构造斯宾塞差集来推广这一结果,但我们放弃了 \(\frac{3^{d+1}-1}{2}\) 是素幂的要求。我们猜想,任何阶为 \(\frac{3^{d+1}(3^{d+1}-1)}{2}\)的群,其正常子群与 \(C_3^{d+1}\)同构,都会有一个斯宾塞差集(这类似于 2 群中狄龙的猜想,该结果在德里斯科的著作中得到了证明)。最后,我们提出了第一个已知的斯宾塞差集的例子,在这个群中,Sylow 3 子群是非阿贝尔的,并且指数大于 3。这种新构造是通过计算与已知斯彭斯差集相关的对称设计的全自形群(\textrm{Aut}(\mathcal {D})),并识别出\(\textrm{Aut}(\mathcal {D})\的一个正则子群而发现的,它使用(3, 3, 3, 1)相关差集来描述差集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: 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.
期刊最新文献
Editorial: WCC 2024—Workshop on coding and cryptography Polygonal triples A tight upper bound on the number of nonzero weights of a quasi-cyclic code Possible values for the nonlinearity of de bruijn feedback functions Authorized multi-key fully homomorphic encryption scheme with compact ciphertext
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1