{"title":"Partial geometric designs having circulant concurrence matrices","authors":"Sung-Yell Song, Theodore Tranel","doi":"10.1002/jcd.21834","DOIUrl":null,"url":null,"abstract":"<p>We classify small partial geometric designs (PGDs) by spectral characteristics of their concurrence matrices. It is well known that the concurrence matrix of a PGD can have at most three distinct eigenvalues, all of which are nonnegative integers. The matrix contains useful information on the incidence structure of the design. An ordinary 2-<math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>v</mi>\n \n <mo>,</mo>\n \n <mi>k</mi>\n \n <mo>,</mo>\n \n <mi>λ</mi>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> $(v,k,\\lambda )$</annotation>\n </semantics></math> design has a single concurrence <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>λ</mi>\n </mrow>\n </mrow>\n <annotation> $\\lambda $</annotation>\n </semantics></math>, and its concurrence matrix is circulant, a partial geometry has two concurrences 1 and 0, and a transversal design <math>\n <semantics>\n <mrow>\n \n <mrow>\n <msub>\n <mtext>TD</mtext>\n \n <mi>λ</mi>\n </msub>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>k</mi>\n \n <mo>,</mo>\n \n <mi>u</mi>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> ${\\text{TD}}_{\\lambda }(k,u)$</annotation>\n </semantics></math> has two concurrences <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>λ</mi>\n </mrow>\n </mrow>\n <annotation> $\\lambda $</annotation>\n </semantics></math> and 0, and its concurrence matrix is circulant. In this paper, we survey the known PGDs by highlighting their concurrences and constructions. Then we investigate which symmetric circulant matrices are realized as the concurrence matrices of PGDs. In particular, we try to give a list of all PGDs of order up to 12 each of which has a circulant concurrence matrix. We then describe these designs along with their combinatorial properties and constructions. This work is part of the second author's Ph.D. dissertation [46].</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"30 6","pages":"420-460"},"PeriodicalIF":0.5000,"publicationDate":"2022-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21834","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21834","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
Abstract
We classify small partial geometric designs (PGDs) by spectral characteristics of their concurrence matrices. It is well known that the concurrence matrix of a PGD can have at most three distinct eigenvalues, all of which are nonnegative integers. The matrix contains useful information on the incidence structure of the design. An ordinary 2- design has a single concurrence , and its concurrence matrix is circulant, a partial geometry has two concurrences 1 and 0, and a transversal design has two concurrences and 0, and its concurrence matrix is circulant. In this paper, we survey the known PGDs by highlighting their concurrences and constructions. Then we investigate which symmetric circulant matrices are realized as the concurrence matrices of PGDs. In particular, we try to give a list of all PGDs of order up to 12 each of which has a circulant concurrence matrix. We then describe these designs along with their combinatorial properties and constructions. This work is part of the second author's Ph.D. dissertation [46].
期刊介绍:
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.