具有非平凡自同构群的PG(2,11)极小块集的分类

IF 0.8 4区 数学 Q3 MATHEMATICS
A. Botteldoorn, K. Coolsaet, V. Fack
{"title":"具有非平凡自同构群的PG(2,11)极小块集的分类","authors":"A. Botteldoorn,&nbsp;K. Coolsaet,&nbsp;V. Fack","doi":"10.1002/jcd.21995","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>We obtain, by computer, a full classification up to equivalence of all minimal blocking sets with a nontrivial automorphism group in the Desarguesian projective plane of order 11. We list the resulting numbers of sets according to their size and the order of their automorphism group. For the minimal blocking sets with the larger automorphism groups, explicit descriptions are given. We also give a list of all blocking semiovals among the results. In contrast to similar work on the planes of smaller order, only those blocking sets were generated that have an automorphism group of size <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mo>&gt;</mo>\n \n <mn>1</mn>\n </mrow>\n </mrow>\n </semantics></math>, as the number of minimal blocking sets with a trivial group is estimated to be infeasibly large. New algorithms had to be devised to obtain these results because simply generating all sets and filtering out those with a nontrivial automorphism group was totally impractical.</p>\n </div>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 10","pages":"388-398"},"PeriodicalIF":0.8000,"publicationDate":"2025-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Classification of Minimal Blocking Sets in \\n \\n \\n \\n PG\\n \\n (\\n \\n 2\\n ,\\n 11\\n \\n )\\n \\n \\n \\n With a Nontrivial Automorphism Group\",\"authors\":\"A. Botteldoorn,&nbsp;K. Coolsaet,&nbsp;V. Fack\",\"doi\":\"10.1002/jcd.21995\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>We obtain, by computer, a full classification up to equivalence of all minimal blocking sets with a nontrivial automorphism group in the Desarguesian projective plane of order 11. We list the resulting numbers of sets according to their size and the order of their automorphism group. For the minimal blocking sets with the larger automorphism groups, explicit descriptions are given. We also give a list of all blocking semiovals among the results. In contrast to similar work on the planes of smaller order, only those blocking sets were generated that have an automorphism group of size <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mo>&gt;</mo>\\n \\n <mn>1</mn>\\n </mrow>\\n </mrow>\\n </semantics></math>, as the number of minimal blocking sets with a trivial group is estimated to be infeasibly large. New algorithms had to be devised to obtain these results because simply generating all sets and filtering out those with a nontrivial automorphism group was totally impractical.</p>\\n </div>\",\"PeriodicalId\":15389,\"journal\":{\"name\":\"Journal of Combinatorial Designs\",\"volume\":\"33 10\",\"pages\":\"388-398\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2025-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Designs\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21995\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21995","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

在11阶的Desarguesian射影平面上,用计算机得到了所有具有非平凡自同构群的最小块集的完全分类。我们根据集合的大小和自同构群的顺序列出结果集合的个数。对于具有较大自同构群的最小块集,给出了显式描述。我们还给出了结果中所有阻塞半椭圆形的列表。与在更小阶平面上的类似工作相反,只生成那些块集具有大小为>;1,因为具有平凡群的最小块集的数量估计是不可行的。必须设计新的算法来获得这些结果,因为简单地生成所有集合并过滤掉那些具有非平凡自同构群的集合是完全不切实际的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Classification of Minimal Blocking Sets in PG ( 2 , 11 ) With a Nontrivial Automorphism Group

We obtain, by computer, a full classification up to equivalence of all minimal blocking sets with a nontrivial automorphism group in the Desarguesian projective plane of order 11. We list the resulting numbers of sets according to their size and the order of their automorphism group. For the minimal blocking sets with the larger automorphism groups, explicit descriptions are given. We also give a list of all blocking semiovals among the results. In contrast to similar work on the planes of smaller order, only those blocking sets were generated that have an automorphism group of size > 1 , as the number of minimal blocking sets with a trivial group is estimated to be infeasibly large. New algorithms had to be devised to obtain these results because simply generating all sets and filtering out those with a nontrivial automorphism group was totally impractical.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.60
自引率
14.30%
发文量
55
审稿时长
>12 weeks
期刊介绍: The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory, and in which design theory has important applications, are covered, including: block designs, t-designs, pairwise balanced designs and group divisible designs Latin squares, quasigroups, and related algebras computational methods in design theory construction methods applications in computer science, experimental design theory, and coding theory graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics finite geometry and its relation with design theory. algebraic aspects of design theory. Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications. All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信