{"title":"Partial Symmetries of Iterated Plethysms","authors":"Álvaro Gutiérrez, Mercedes H. Rosas","doi":"10.1007/s00026-023-00652-4","DOIUrl":null,"url":null,"abstract":"<div><p>This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed by one-row partitions.The partial symmetries are described in terms of an involution on partitions, the flip involution, that generalizes the ubiquitous <span>\\(\\omega \\)</span> involution. Schur-positive symmetric functions possessing this partial symmetry are termed flip-symmetric. The operation of taking plethysm with <span>\\(s_\\lambda \\)</span> preserves flip-symmetry, provided that <span>\\(\\lambda \\)</span> is a partition of two. Explicit formulas for the iterated plethysms <span>\\(s_2\\circ s_b\\circ s_a\\)</span> and <span>\\(s_c\\circ s_2\\circ s_a\\)</span>, with <i>a</i>, <i>b</i>, and <i>c</i> <span>\\(\\ge \\)</span> 2 allow us to show that these two families of iterated plethysms are flip-symmetric. The article concludes with some observations, remarks, and open questions on the unimodality and asymptotic normality of certain flip-symmetric sequences of iterated plethystic coefficients.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"27 3","pages":"493 - 518"},"PeriodicalIF":0.6000,"publicationDate":"2023-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-023-00652-4","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 1
Abstract
This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed by one-row partitions.The partial symmetries are described in terms of an involution on partitions, the flip involution, that generalizes the ubiquitous \(\omega \) involution. Schur-positive symmetric functions possessing this partial symmetry are termed flip-symmetric. The operation of taking plethysm with \(s_\lambda \) preserves flip-symmetry, provided that \(\lambda \) is a partition of two. Explicit formulas for the iterated plethysms \(s_2\circ s_b\circ s_a\) and \(s_c\circ s_2\circ s_a\), with a, b, and c\(\ge \) 2 allow us to show that these two families of iterated plethysms are flip-symmetric. The article concludes with some observations, remarks, and open questions on the unimodality and asymptotic normality of certain flip-symmetric sequences of iterated plethystic coefficients.
期刊介绍:
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