{"title":"规避模式的对称横截面上的外峰组合学","authors":"Robin D. P. Zhou, Sherry H. F. Yan","doi":"10.1007/s00026-023-00664-0","DOIUrl":null,"url":null,"abstract":"<div><p>Let <span>\\(\\mathcal{S}\\mathcal{T}_{\\lambda }(\\tau )\\)</span> denote the set of symmetric transversals of a self-conjugate Young diagram <span>\\(\\lambda \\)</span> which avoid the permutation pattern <span>\\(\\tau \\)</span>. Given two permutations <span>\\(\\tau = \\tau _1\\tau _2\\ldots \\tau _n \\)</span> of <span>\\(\\{1,2,\\ldots ,n\\}\\)</span> and <span>\\(\\sigma =\\sigma _1\\sigma _2\\ldots \\sigma _m \\)</span> of <span>\\(\\{1,2,\\ldots ,m\\}\\)</span>, the <i>direct sum</i> of <span>\\(\\tau \\)</span> and <span>\\(\\sigma \\)</span>, denoted by <span>\\(\\tau \\oplus \\sigma \\)</span>, is the permutation <span>\\(\\tau _1\\tau _2\\ldots \\tau _n (\\sigma _1+n)(\\sigma _2+n)\\ldots (\\sigma _m+n)\\)</span>. We establish an exterior peak set preserving bijection between <span>\\(\\mathcal{S}\\mathcal{T}_{\\lambda }(321\\oplus \\tau )\\)</span> and <span>\\(\\mathcal{S}\\mathcal{T}_{\\lambda }(213\\oplus \\tau )\\)</span> for any pattern <span>\\(\\tau \\)</span> and any self-conjugate Young diagram <span>\\(\\lambda \\)</span>. Our result is a refinement of part of a result of Bousquet-Mélou–Steingrímsson for pattern-avoiding symmetric transversals. As applications, we derive several enumerative results concerning pattern-avoiding reverse alternating involutions, including two conjectured equalities posed by Barnabei–Bonetti–Castronuovo–Silimbani.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"28 3","pages":"977 - 1002"},"PeriodicalIF":0.6000,"publicationDate":"2023-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-023-00664-0.pdf","citationCount":"0","resultStr":"{\"title\":\"Combinatorics of Exterior Peaks on Pattern-Avoiding Symmetric Transversals\",\"authors\":\"Robin D. P. Zhou, Sherry H. F. Yan\",\"doi\":\"10.1007/s00026-023-00664-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Let <span>\\\\(\\\\mathcal{S}\\\\mathcal{T}_{\\\\lambda }(\\\\tau )\\\\)</span> denote the set of symmetric transversals of a self-conjugate Young diagram <span>\\\\(\\\\lambda \\\\)</span> which avoid the permutation pattern <span>\\\\(\\\\tau \\\\)</span>. Given two permutations <span>\\\\(\\\\tau = \\\\tau _1\\\\tau _2\\\\ldots \\\\tau _n \\\\)</span> of <span>\\\\(\\\\{1,2,\\\\ldots ,n\\\\}\\\\)</span> and <span>\\\\(\\\\sigma =\\\\sigma _1\\\\sigma _2\\\\ldots \\\\sigma _m \\\\)</span> of <span>\\\\(\\\\{1,2,\\\\ldots ,m\\\\}\\\\)</span>, the <i>direct sum</i> of <span>\\\\(\\\\tau \\\\)</span> and <span>\\\\(\\\\sigma \\\\)</span>, denoted by <span>\\\\(\\\\tau \\\\oplus \\\\sigma \\\\)</span>, is the permutation <span>\\\\(\\\\tau _1\\\\tau _2\\\\ldots \\\\tau _n (\\\\sigma _1+n)(\\\\sigma _2+n)\\\\ldots (\\\\sigma _m+n)\\\\)</span>. We establish an exterior peak set preserving bijection between <span>\\\\(\\\\mathcal{S}\\\\mathcal{T}_{\\\\lambda }(321\\\\oplus \\\\tau )\\\\)</span> and <span>\\\\(\\\\mathcal{S}\\\\mathcal{T}_{\\\\lambda }(213\\\\oplus \\\\tau )\\\\)</span> for any pattern <span>\\\\(\\\\tau \\\\)</span> and any self-conjugate Young diagram <span>\\\\(\\\\lambda \\\\)</span>. Our result is a refinement of part of a result of Bousquet-Mélou–Steingrímsson for pattern-avoiding symmetric transversals. As applications, we derive several enumerative results concerning pattern-avoiding reverse alternating involutions, including two conjectured equalities posed by Barnabei–Bonetti–Castronuovo–Silimbani.</p></div>\",\"PeriodicalId\":50769,\"journal\":{\"name\":\"Annals of Combinatorics\",\"volume\":\"28 3\",\"pages\":\"977 - 1002\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00026-023-00664-0.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00026-023-00664-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-00664-0","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Combinatorics of Exterior Peaks on Pattern-Avoiding Symmetric Transversals
Let \(\mathcal{S}\mathcal{T}_{\lambda }(\tau )\) denote the set of symmetric transversals of a self-conjugate Young diagram \(\lambda \) which avoid the permutation pattern \(\tau \). Given two permutations \(\tau = \tau _1\tau _2\ldots \tau _n \) of \(\{1,2,\ldots ,n\}\) and \(\sigma =\sigma _1\sigma _2\ldots \sigma _m \) of \(\{1,2,\ldots ,m\}\), the direct sum of \(\tau \) and \(\sigma \), denoted by \(\tau \oplus \sigma \), is the permutation \(\tau _1\tau _2\ldots \tau _n (\sigma _1+n)(\sigma _2+n)\ldots (\sigma _m+n)\). We establish an exterior peak set preserving bijection between \(\mathcal{S}\mathcal{T}_{\lambda }(321\oplus \tau )\) and \(\mathcal{S}\mathcal{T}_{\lambda }(213\oplus \tau )\) for any pattern \(\tau \) and any self-conjugate Young diagram \(\lambda \). Our result is a refinement of part of a result of Bousquet-Mélou–Steingrímsson for pattern-avoiding symmetric transversals. As applications, we derive several enumerative results concerning pattern-avoiding reverse alternating involutions, including two conjectured equalities posed by Barnabei–Bonetti–Castronuovo–Silimbani.
期刊介绍:
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