Block-transitive 2-designs with a chain of imprimitive point-partitions

IF 0.9 2区 数学 Q2 MATHEMATICS Journal of Combinatorial Theory Series A Pub Date : 2024-02-01 DOI:10.1016/j.jcta.2024.105866
Carmen Amarra , Alice Devillers , Cheryl E. Praeger
{"title":"Block-transitive 2-designs with a chain of imprimitive point-partitions","authors":"Carmen Amarra ,&nbsp;Alice Devillers ,&nbsp;Cheryl E. Praeger","doi":"10.1016/j.jcta.2024.105866","DOIUrl":null,"url":null,"abstract":"<div><p>More than 30 years ago, Delandtsheer and Doyen showed that the automorphism group of a block-transitive 2-design, with blocks of size <em>k</em>, could leave invariant a nontrivial point-partition, but only if the number of points was bounded in terms of <em>k</em>. Since then examples have been found where there are two nontrivial point partitions, either forming a chain of partitions, or forming a grid structure on the point set. We show, by construction of infinite families of designs, that there is no limit on the length of a chain of invariant point partitions for a block-transitive 2-design. We introduce the notion of an ‘array’ of a set of points which describes how the set interacts with parts of the various partitions, and we obtain necessary and sufficient conditions in terms of the ‘array’ of a point set, relative to a partition chain, for it to be a block of such a design.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"205 ","pages":"Article 105866"},"PeriodicalIF":0.9000,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097316524000050/pdfft?md5=4350b32c706696ea2c3f719fb15cd8bc&pid=1-s2.0-S0097316524000050-main.pdf","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/S0097316524000050","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

More than 30 years ago, Delandtsheer and Doyen showed that the automorphism group of a block-transitive 2-design, with blocks of size k, could leave invariant a nontrivial point-partition, but only if the number of points was bounded in terms of k. Since then examples have been found where there are two nontrivial point partitions, either forming a chain of partitions, or forming a grid structure on the point set. We show, by construction of infinite families of designs, that there is no limit on the length of a chain of invariant point partitions for a block-transitive 2-design. We introduce the notion of an ‘array’ of a set of points which describes how the set interacts with parts of the various partitions, and we obtain necessary and sufficient conditions in terms of the ‘array’ of a point set, relative to a partition chain, for it to be a block of such a design.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
带有一连串隐含点分区的块变换 2 设计
30 多年前,德兰切尔和多延证明,大小为 k 块的块变换 2 设计的自动形群可以使一个非难点分区保持不变,但前提是点的数量以 k 为界。自那时起,人们发现了有两个非难点分区的例子,它们要么形成了分区链,要么在点集中形成了网格结构。我们通过构建无穷设计族证明,对于块过渡 2 设计,不变点分区链的长度没有限制。我们引入了点集 "阵列 "的概念,它描述了点集如何与不同分区的部分相互作用,我们还获得了点集 "阵列 "相对于分区链的必要条件和充分条件,从而使其成为这种设计的区块。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.90
自引率
9.10%
发文量
94
审稿时长
12 months
期刊介绍: 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.
期刊最新文献
Dominance complexes, neighborhood complexes and combinatorial Alexander duals Upper bounds for the number of substructures in finite geometries from the container method The vector space generated by permutations of a trade or a design Editorial Board Some conjectures of Ballantine and Merca on truncated sums and the minimal excludant in congruences classes
×
引用
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