Allen Herman, Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra
{"title":"关于对称群Sym群关联方案的Terwilliger代数(7)","authors":"Allen Herman, Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra","doi":"10.1002/jcd.21981","DOIUrl":null,"url":null,"abstract":"<p>Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class association schemes of the symmetric groups <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mtext>Sym</mtext>\n \n <mrow>\n <mo>(</mo>\n \n <mi>n</mi>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>, for <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mn>3</mn>\n \n <mo>≤</mo>\n \n <mi>n</mi>\n \n <mo>≤</mo>\n \n <mn>6</mn>\n </mrow>\n </mrow>\n </semantics></math>, have been studied and completely determined. The case for <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mtext>Sym</mtext>\n \n <mrow>\n <mo>(</mo>\n \n <mn>7</mn>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math> is computationally much more difficult and has a potential application to find the size of the largest permutation codes of <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mtext>Sym</mtext>\n \n <mrow>\n <mo>(</mo>\n \n <mn>7</mn>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math> with a minimal distance of at least 4. In this paper, the dimension, the Wedderburn decomposition, and the block dimension decomposition of the Terwilliger algebra of the conjugacy class scheme of the group <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mtext>Sym</mtext>\n \n <mrow>\n <mo>(</mo>\n \n <mn>7</mn>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math> are determined.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"33 7","pages":"261-274"},"PeriodicalIF":0.5000,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21981","citationCount":"0","resultStr":"{\"title\":\"On the Terwilliger Algebra of the Group Association Scheme of the Symmetric Group \\n \\n \\n \\n Sym\\n \\n (\\n 7\\n )\",\"authors\":\"Allen Herman, Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra\",\"doi\":\"10.1002/jcd.21981\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class association schemes of the symmetric groups <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mtext>Sym</mtext>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mi>n</mi>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math>, for <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mn>3</mn>\\n \\n <mo>≤</mo>\\n \\n <mi>n</mi>\\n \\n <mo>≤</mo>\\n \\n <mn>6</mn>\\n </mrow>\\n </mrow>\\n </semantics></math>, have been studied and completely determined. The case for <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mtext>Sym</mtext>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mn>7</mn>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math> is computationally much more difficult and has a potential application to find the size of the largest permutation codes of <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mtext>Sym</mtext>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mn>7</mn>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math> with a minimal distance of at least 4. In this paper, the dimension, the Wedderburn decomposition, and the block dimension decomposition of the Terwilliger algebra of the conjugacy class scheme of the group <span></span><math>\\n <semantics>\\n <mrow>\\n \\n <mrow>\\n <mtext>Sym</mtext>\\n \\n <mrow>\\n <mo>(</mo>\\n \\n <mn>7</mn>\\n \\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n </mrow>\\n </semantics></math> are determined.</p>\",\"PeriodicalId\":15389,\"journal\":{\"name\":\"Journal of Combinatorial Designs\",\"volume\":\"33 7\",\"pages\":\"261-274\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2025-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jcd.21981\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Designs\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21981\",\"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.21981","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
On the Terwilliger Algebra of the Group Association Scheme of the Symmetric Group
Sym
(
7
)
Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class association schemes of the symmetric groups , for , have been studied and completely determined. The case for is computationally much more difficult and has a potential application to find the size of the largest permutation codes of with a minimal distance of at least 4. In this paper, the dimension, the Wedderburn decomposition, and the block dimension decomposition of the Terwilliger algebra of the conjugacy class scheme of the group are determined.
期刊介绍:
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.