{"title":"具有非平凡自同构群的PG(2,11)极小块集的分类","authors":"A. Botteldoorn, K. Coolsaet, 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>></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, K. Coolsaet, 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>></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}
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 , 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.
期刊介绍:
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.