{"title":"自对偶关联方案、Hamming方案的融合和部分几何设计","authors":"Bangteng Xu","doi":"10.1002/jcd.21889","DOIUrl":null,"url":null,"abstract":"<p>Partial geometric designs can be constructed from basic relations of association schemes. An infinite family of partial geometric designs were constructed from the fusion schemes of certain Hamming schemes in work by Nowak et al. (2016). A general method to create partial geometric designs from association schemes is given by Xu (2023). In this paper, we continue the research by Xu (2023). We will first study the properties and characterizations of self-dual association schemes. Then using the characterizations of self-dual association schemes and the representation theory (character tables) of commutative association schemes, we obtain characterizations and classifications of self-dual (symmetric or nonsymmetric) association schemes of rank 4 that produce as many as possible nontrivial partial geometric designs or 2-designs. In particular, for a primitive self-dual symmetric association scheme <math>\n <semantics>\n <mrow>\n <mi>X</mi>\n \n <mo>=</mo>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>X</mi>\n \n <mo>,</mo>\n \n <msub>\n <mrow>\n <mo>{</mo>\n \n <msub>\n <mi>R</mi>\n \n <mi>i</mi>\n </msub>\n \n <mo>}</mo>\n </mrow>\n \n <mrow>\n <mn>0</mn>\n \n <mo>≤</mo>\n \n <mi>i</mi>\n \n <mo>≤</mo>\n \n <mn>3</mn>\n </mrow>\n </msub>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> ${\\mathscr{X}}=(X,{\\{{R}_{i}\\}}_{0\\le i\\le 3})$</annotation>\n </semantics></math> of rank 4, if <math>\n <semantics>\n <mrow>\n <mo>∣</mo>\n \n <mi>X</mi>\n \n <mo>∣</mo>\n </mrow>\n <annotation> $| X| $</annotation>\n </semantics></math> is a power of 3 and each of <math>\n <semantics>\n <mrow>\n <msub>\n <mi>R</mi>\n \n <mn>1</mn>\n </msub>\n </mrow>\n <annotation> ${R}_{1}$</annotation>\n </semantics></math>, <math>\n <semantics>\n <mrow>\n <msub>\n <mi>R</mi>\n \n <mn>2</mn>\n </msub>\n </mrow>\n <annotation> ${R}_{2}$</annotation>\n </semantics></math>, and <math>\n <semantics>\n <mrow>\n <msub>\n <mi>R</mi>\n \n <mn>0</mn>\n </msub>\n \n <mo>∪</mo>\n \n <msub>\n <mi>R</mi>\n \n <mn>3</mn>\n </msub>\n </mrow>\n <annotation> ${R}_{0}\\cup {R}_{3}$</annotation>\n </semantics></math> induces a partial geometric design, then we will prove that <math>\n <semantics>\n <mrow>\n <mi>X</mi>\n </mrow>\n <annotation> ${\\mathscr{X}}$</annotation>\n </semantics></math> is algebraically isomorphic to a fusion scheme of the Hamming scheme <math>\n <semantics>\n <mrow>\n <mi>H</mi>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>d</mi>\n \n <mo>,</mo>\n \n <mn>3</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation> $H(d,3)$</annotation>\n </semantics></math> for some odd number <math>\n <semantics>\n <mrow>\n <mi>d</mi>\n </mrow>\n <annotation> $d$</annotation>\n </semantics></math>.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 8","pages":"373-399"},"PeriodicalIF":0.5000,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Self-dual association schemes, fusions of Hamming schemes, and partial geometric designs\",\"authors\":\"Bangteng Xu\",\"doi\":\"10.1002/jcd.21889\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Partial geometric designs can be constructed from basic relations of association schemes. An infinite family of partial geometric designs were constructed from the fusion schemes of certain Hamming schemes in work by Nowak et al. (2016). A general method to create partial geometric designs from association schemes is given by Xu (2023). In this paper, we continue the research by Xu (2023). We will first study the properties and characterizations of self-dual association schemes. Then using the characterizations of self-dual association schemes and the representation theory (character tables) of commutative association schemes, we obtain characterizations and classifications of self-dual (symmetric or nonsymmetric) association schemes of rank 4 that produce as many as possible nontrivial partial geometric designs or 2-designs. In particular, for a primitive self-dual symmetric association scheme <math>\\n <semantics>\\n <mrow>\\n <mi>X</mi>\\n \\n <mo>=</mo>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>X</mi>\\n \\n <mo>,</mo>\\n \\n <msub>\\n <mrow>\\n <mo>{</mo>\\n \\n <msub>\\n <mi>R</mi>\\n \\n <mi>i</mi>\\n </msub>\\n \\n <mo>}</mo>\\n </mrow>\\n \\n <mrow>\\n <mn>0</mn>\\n \\n <mo>≤</mo>\\n \\n <mi>i</mi>\\n \\n <mo>≤</mo>\\n \\n <mn>3</mn>\\n </mrow>\\n </msub>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n <annotation> ${\\\\mathscr{X}}=(X,{\\\\{{R}_{i}\\\\}}_{0\\\\le i\\\\le 3})$</annotation>\\n </semantics></math> of rank 4, if <math>\\n <semantics>\\n <mrow>\\n <mo>∣</mo>\\n \\n <mi>X</mi>\\n \\n <mo>∣</mo>\\n </mrow>\\n <annotation> $| X| $</annotation>\\n </semantics></math> is a power of 3 and each of <math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>R</mi>\\n \\n <mn>1</mn>\\n </msub>\\n </mrow>\\n <annotation> ${R}_{1}$</annotation>\\n </semantics></math>, <math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>R</mi>\\n \\n <mn>2</mn>\\n </msub>\\n </mrow>\\n <annotation> ${R}_{2}$</annotation>\\n </semantics></math>, and <math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>R</mi>\\n \\n <mn>0</mn>\\n </msub>\\n \\n <mo>∪</mo>\\n \\n <msub>\\n <mi>R</mi>\\n \\n <mn>3</mn>\\n </msub>\\n </mrow>\\n <annotation> ${R}_{0}\\\\cup {R}_{3}$</annotation>\\n </semantics></math> induces a partial geometric design, then we will prove that <math>\\n <semantics>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <annotation> ${\\\\mathscr{X}}$</annotation>\\n </semantics></math> is algebraically isomorphic to a fusion scheme of the Hamming scheme <math>\\n <semantics>\\n <mrow>\\n <mi>H</mi>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mrow>\\n <mi>d</mi>\\n \\n <mo>,</mo>\\n \\n <mn>3</mn>\\n </mrow>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n <annotation> $H(d,3)$</annotation>\\n </semantics></math> for some odd number <math>\\n <semantics>\\n <mrow>\\n <mi>d</mi>\\n </mrow>\\n <annotation> $d$</annotation>\\n </semantics></math>.</p>\",\"PeriodicalId\":15389,\"journal\":{\"name\":\"Journal of Combinatorial Designs\",\"volume\":\"31 8\",\"pages\":\"373-399\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Designs\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21889\",\"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.21889","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
Self-dual association schemes, fusions of Hamming schemes, and partial geometric designs
Partial geometric designs can be constructed from basic relations of association schemes. An infinite family of partial geometric designs were constructed from the fusion schemes of certain Hamming schemes in work by Nowak et al. (2016). A general method to create partial geometric designs from association schemes is given by Xu (2023). In this paper, we continue the research by Xu (2023). We will first study the properties and characterizations of self-dual association schemes. Then using the characterizations of self-dual association schemes and the representation theory (character tables) of commutative association schemes, we obtain characterizations and classifications of self-dual (symmetric or nonsymmetric) association schemes of rank 4 that produce as many as possible nontrivial partial geometric designs or 2-designs. In particular, for a primitive self-dual symmetric association scheme of rank 4, if is a power of 3 and each of , , and induces a partial geometric design, then we will prove that is algebraically isomorphic to a fusion scheme of the Hamming scheme for some odd number .
期刊介绍:
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.