Chain-imprimitive, flag-transitive 2-designs

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-04-20 DOI:10.1007/s10623-024-01400-2
Carmen Amarra, Alice Devillers, Cheryl E. Praeger
{"title":"Chain-imprimitive, flag-transitive 2-designs","authors":"Carmen Amarra, Alice Devillers, Cheryl E. Praeger","doi":"10.1007/s10623-024-01400-2","DOIUrl":null,"url":null,"abstract":"<p>We consider 2-designs which admit a group of automorphisms that is flag-transitive and leaves invariant a chain of nontrivial point-partitions. We build on our recent work on 2-designs which are block-transitive but not necessarily flag-transitive. In particular we use the concept of the “array” of a point subset with respect to the chain of point-partitions; the array describes the distribution of the points in the subset among the classes of each partition. We obtain necessary and sufficient conditions on the array in order for the subset to be a block of such a design. By explicit construction we show that for any <span>\\(s \\ge 2\\)</span>, there are infinitely many 2-designs admitting a flag-transitive group that preserves an invariant chain of point-partitions of length <i>s</i>. Moreover an exhaustive computer search, using <span>Magma</span>, seeking designs with <span>\\(e_1e_2e_3\\)</span> points (where each <span>\\(e_i\\le 50\\)</span>) and a partition chain of length <span>\\(s=3\\)</span>, produced 57 such flag-transitive designs, among which only three designs arise from our construction—so there is still much to learn.\n</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-04-20","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-01400-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

We consider 2-designs which admit a group of automorphisms that is flag-transitive and leaves invariant a chain of nontrivial point-partitions. We build on our recent work on 2-designs which are block-transitive but not necessarily flag-transitive. In particular we use the concept of the “array” of a point subset with respect to the chain of point-partitions; the array describes the distribution of the points in the subset among the classes of each partition. We obtain necessary and sufficient conditions on the array in order for the subset to be a block of such a design. By explicit construction we show that for any \(s \ge 2\), there are infinitely many 2-designs admitting a flag-transitive group that preserves an invariant chain of point-partitions of length s. Moreover an exhaustive computer search, using Magma, seeking designs with \(e_1e_2e_3\) points (where each \(e_i\le 50\)) and a partition chain of length \(s=3\), produced 57 such flag-transitive designs, among which only three designs arise from our construction—so there is still much to learn.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
链式祈使句、旗式祈使句 2 种设计
我们考虑的是二元平面设计,其自动形群是旗帜传递的,并使一连串非难点分区保持不变。我们的研究是建立在我们最近的工作基础之上的,这些工作涉及的是块遍历但不一定是旗遍历的 2 设计。我们特别使用了点子集相对于点分区链的 "数组 "概念;数组描述了子集中的点在每个分区的类中的分布。我们获得了数组的必要条件和充分条件,从而使子集成为这种设计的区块。通过明确的构造,我们证明了对于任意的(s),有无限多的2-设计允许一个保留长度为s的点分区不变链的旗跨群。此外,我们使用Magma进行了一次详尽的计算机搜索,寻找有\(e_1e_2e_3\)个点(其中每个点有\(e_i\le 50\))和长度为\(s=3\)的分区链的设计,结果发现有57个这样的旗透式设计,其中只有3个设计来自于我们的构造--所以我们还有很多东西要学。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Asymptotically optimal aperiodic quasi-complementary sequence sets based on extended Boolean functions Arithmetization-oriented APN permutations Non-linear MRD codes from cones over exterior sets Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes Designs in finite classical polar spaces
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1