Alternating permutations and symmetric functions
From MaRDI portal
Publication:878952
DOI10.1016/J.JCTA.2006.06.008zbMATH Open1118.05002arXivmath/0603520OpenAlexW1974226462MaRDI QIDQ878952FDOQ878952
Authors: Richard P. Stanley 
Publication date: 4 May 2007
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Abstract: We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as (m-1,m-2,...,1), under the RSK algorithm, (3) w has a specified cycle type, and (4) w has a specified number of fixed points. We also enumerate alternating permutations of a multiset. Most of our formulas are umbral expressions where after expanding the expression in powers of a variable E, E^k is interpreted as the Euler number E_k. As a small corollary, we obtain a combinatorial interpretation of the coefficients of an asymptotic expansion appearing in Ramanujan's Lost Notebook.
Full work available at URL: https://arxiv.org/abs/math/0603520
Recommendations
- Permutation enumeration of the symmetric group and the combinatorics of symmetric functions
- Permutation enumeration symmetric functions, and unimodality
- Alternating subsets and permutations
- A family of symmetric functions associated with Stirling permutations
- The \(r\)-alternating permutations
- Symmetric multisets of permutations
- A survey of alternating permutations
- Permutation polynomials on symmetric matrices
- Permutation and complete permutation polynomials
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Umbral calculus (05A40) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Asymptotic enumeration (05A16)
Cites Work
- Title not available (Why is that?)
- The Classical Umbral Calculus
- Title not available (Why is that?)
- Symmetric functions and P-recursiveness
- Advanced determinant calculus
- Counting permutations with given cycle structure and descent set
- Title not available (Why is that?)
- Enumeration of up-down sequences
- Classical Orthogonal Polynomials as Moments
- Ramanujan's ``lost notebook. I: Partial Theta-functions
- Enumeration of permutations with prescribed up-down and inversion sequences
- Title not available (Why is that?)
- Weighted Derangements and the Linearization Coefficients of Orthogonal Sheffer Polynomials
- Doubly alternating Baxter permutations are Catalan
- Tangent and secant numbers and representations of symmetric groups
- Multiplicities of Higher Lie Characters
Cited In (23)
- The plethystic inverse of the odd Lie representations
- Foulkes characters, Eulerian idempotents, and an amazing matrix
- Simple permutations and algebraic generating functions
- On refinements of Wilf-equivalence for involutions
- The asymptotics of almost alternating permutations
- Fix-Mahonian calculus. I: Two transformations
- Equidistribution of set-valued statistics on standard Young tableaux and transversals
- Combinatorics of generalized \(q\)-Euler numbers
- Exact and asymptotic enumeration of cyclic permutations according to descent set
- Permutation enumeration symmetric functions, and unimodality
- Plethystic formulas for permutation enumeration
- Labeled binary trees, subarrangements of the Catalan arrangements, and Schur positivity
- Koszul duality for monoids and the operad of enriched rooted trees
- Pattern avoidance for alternating permutations and Young tableaux
- Combinatorics of exterior peaks on pattern-avoiding symmetric transversals
- Two-sided permutation statistics via symmetric functions
- Title not available (Why is that?)
- Symmetric generating functions and Euler-Stirling statistics on permutations
- Pattern avoiding alternating involutions
- The number of cycles with a given descent set
- Unimodal permutations and almost-increasing cycles
- Up-down coefficients for permutations
- Permutations with extremal number of fixed points
Uses Software
This page was built for publication: Alternating permutations and symmetric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878952)
