{"title":"具有点传递自同构群的2-(196,6,1)设计的不存在性","authors":"Xiaohong Zhang, Shenglin Zhou","doi":"10.1002/jcd.70029","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Camina and Di Martino proved that any block-transitive automorphism group of a 2-<span></span><math>\n <semantics>\n <mrow>\n <mrow>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mn>196</mn>\n <mo>,</mo>\n <mn>6</mn>\n <mo>,</mo>\n <mn>1</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math> design must be flag-transitive. However, the question whether a point-transitive automorphism group can exist for such a design remains unsolved. In the present study, we show that no 2-<span></span><math>\n <semantics>\n <mrow>\n <mrow>\n <mrow>\n <mo>(</mo>\n <mrow>\n <mn>196</mn>\n <mo>,</mo>\n <mn>6</mn>\n <mo>,</mo>\n <mn>1</mn>\n </mrow>\n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math> design admits a point-transitive automorphism group.</p>\n </div>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"34 11","pages":"498-502"},"PeriodicalIF":0.8000,"publicationDate":"2026-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nonexistence of a 2-\\n \\n \\n \\n \\n (\\n \\n 196\\n ,\\n 6\\n ,\\n 1\\n \\n )\\n \\n \\n \\n Design With a Point-Transitive Automorphism Group\",\"authors\":\"Xiaohong Zhang, Shenglin Zhou\",\"doi\":\"10.1002/jcd.70029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Camina and Di Martino proved that any block-transitive automorphism group of a 2-<span></span><math>\\n <semantics>\\n <mrow>\\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mn>196</mn>\\n <mo>,</mo>\\n <mn>6</mn>\\n <mo>,</mo>\\n <mn>1</mn>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math> design must be flag-transitive. However, the question whether a point-transitive automorphism group can exist for such a design remains unsolved. In the present study, we show that no 2-<span></span><math>\\n <semantics>\\n <mrow>\\n <mrow>\\n <mrow>\\n <mo>(</mo>\\n <mrow>\\n <mn>196</mn>\\n <mo>,</mo>\\n <mn>6</mn>\\n <mo>,</mo>\\n <mn>1</mn>\\n </mrow>\\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math> design admits a point-transitive automorphism group.</p>\\n </div>\",\"PeriodicalId\":15389,\"journal\":{\"name\":\"Journal of Combinatorial Designs\",\"volume\":\"34 11\",\"pages\":\"498-502\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2026-09-07\",\"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.70029\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2026/7/31 0:00:00\",\"PubModel\":\"Epub\",\"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.70029","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/7/31 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
Nonexistence of a 2-
(
196
,
6
,
1
)
Design With a Point-Transitive Automorphism Group
Camina and Di Martino proved that any block-transitive automorphism group of a 2- design must be flag-transitive. However, the question whether a point-transitive automorphism group can exist for such a design remains unsolved. In the present study, we show that no 2- design admits a point-transitive automorphism group.
期刊介绍:
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.