{"title":"Classification of minimal blocking sets in small Desarguesian projective planes","authors":"Kris Coolsaet, Arne Botteldoorn, Veerle Fack","doi":"10.1002/jcd.21842","DOIUrl":null,"url":null,"abstract":"<p>A full classification (up to equivalence) of all minimal blocking sets in Desarguesian projective planes of order <math>\n <mrow>\n \n <mrow>\n <mo>≤</mo>\n \n <mn>8</mn>\n </mrow>\n </mrow></math> was obtained by computer. The resulting numbers of minimal blocking sets are tabulated according to size of the set and order of the automorphism group. For the minimal blocking sets with the larger automorphism groups explicit descriptions are given. Some of these results can also be generalised to Desarguesian projective planes of higher order.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"30 8","pages":"561-580"},"PeriodicalIF":0.5000,"publicationDate":"2022-03-31","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.21842","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
A full classification (up to equivalence) of all minimal blocking sets in Desarguesian projective planes of order was obtained by computer. The resulting numbers of minimal blocking sets are tabulated according to size of the set and order of the automorphism group. For the minimal blocking sets with the larger automorphism groups explicit descriptions are given. Some of these results can also be generalised to Desarguesian projective planes of higher order.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
