{"title":"通过Web折叠旋转对称Tableaux","authors":"Kevin Purbhoo, Shelley Wu","doi":"10.1007/s00026-023-00648-0","DOIUrl":null,"url":null,"abstract":"<div><p>Rectangular standard Young tableaux with 2 or 3 rows are in bijection with <span>\\(U_q(\\mathfrak {sl}_2)\\)</span>-webs and <span>\\(U_q(\\mathfrak {sl}_3)\\)</span>-webs, respectively. When <span>\\(\\mathcal {W}\\)</span> is a web with a reflection symmetry, the corresponding tableau <span>\\(T_\\mathcal {W}\\)</span> has a rotational symmetry. Folding <span>\\(T_\\mathcal {W}\\)</span> transforms it into a domino tableau <span>\\(D_\\mathcal {W}\\)</span>. We study the relationships between these correspondences. For 2-row tableaux, folding a rotationally symmetric tableau corresponds to “literally folding” the web along its axis of symmetry. For 3-row tableaux, we give simple algorithms, which provide direct bijective maps between symmetrical webs and domino tableaux (in both directions). These details of these algorithms reflect the intuitive idea that <span>\\(D_\\mathcal {W}\\)</span> corresponds to “<span>\\(\\mathcal {W}\\)</span> modulo symmetry”.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"28 1","pages":"93 - 119"},"PeriodicalIF":0.6000,"publicationDate":"2023-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Folding Rotationally Symmetric Tableaux via Webs\",\"authors\":\"Kevin Purbhoo, Shelley Wu\",\"doi\":\"10.1007/s00026-023-00648-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Rectangular standard Young tableaux with 2 or 3 rows are in bijection with <span>\\\\(U_q(\\\\mathfrak {sl}_2)\\\\)</span>-webs and <span>\\\\(U_q(\\\\mathfrak {sl}_3)\\\\)</span>-webs, respectively. When <span>\\\\(\\\\mathcal {W}\\\\)</span> is a web with a reflection symmetry, the corresponding tableau <span>\\\\(T_\\\\mathcal {W}\\\\)</span> has a rotational symmetry. Folding <span>\\\\(T_\\\\mathcal {W}\\\\)</span> transforms it into a domino tableau <span>\\\\(D_\\\\mathcal {W}\\\\)</span>. We study the relationships between these correspondences. For 2-row tableaux, folding a rotationally symmetric tableau corresponds to “literally folding” the web along its axis of symmetry. For 3-row tableaux, we give simple algorithms, which provide direct bijective maps between symmetrical webs and domino tableaux (in both directions). These details of these algorithms reflect the intuitive idea that <span>\\\\(D_\\\\mathcal {W}\\\\)</span> corresponds to “<span>\\\\(\\\\mathcal {W}\\\\)</span> modulo symmetry”.</p></div>\",\"PeriodicalId\":50769,\"journal\":{\"name\":\"Annals of Combinatorics\",\"volume\":\"28 1\",\"pages\":\"93 - 119\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00026-023-00648-0\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-023-00648-0","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Rectangular standard Young tableaux with 2 or 3 rows are in bijection with \(U_q(\mathfrak {sl}_2)\)-webs and \(U_q(\mathfrak {sl}_3)\)-webs, respectively. When \(\mathcal {W}\) is a web with a reflection symmetry, the corresponding tableau \(T_\mathcal {W}\) has a rotational symmetry. Folding \(T_\mathcal {W}\) transforms it into a domino tableau \(D_\mathcal {W}\). We study the relationships between these correspondences. For 2-row tableaux, folding a rotationally symmetric tableau corresponds to “literally folding” the web along its axis of symmetry. For 3-row tableaux, we give simple algorithms, which provide direct bijective maps between symmetrical webs and domino tableaux (in both directions). These details of these algorithms reflect the intuitive idea that \(D_\mathcal {W}\) corresponds to “\(\mathcal {W}\) modulo symmetry”.
期刊介绍:
Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board.
The scope of Annals of Combinatorics is covered by the following three tracks:
Algebraic Combinatorics:
Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices
Analytic and Algorithmic Combinatorics:
Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms
Graphs and Matroids:
Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches