Permutation enumeration of the symmetric group and the combinatorics of symmetric functions
\textit{F. Brenti} [Pac. J. Math. 157, No. 1, 1-28 (1993; Zbl 0805.05089)] has shown that the polynomials obtained by enumerating conjugacy classes of the symmetric group \(S_n\) with respect to excedances are unimodal and symmetric, and thus arises naturally from the theory of symmetric functions. The authors give combinatorial proofs and interpretations for the various bases of symmetric functions under \(\xi\), a homomorphism (introduced by Brenti) on the ring of symmetric functions, where \(\xi(e_i)= (1- x)^{k- 1}/k!\) is the image of the elementary symmetric function \(e_k\), \(\xi(e_0)= 1\). Their combinatorial methods lead to numerous extensions, e.g. \(q\)-analogues which involve the inversion statistics, as well as a definition of new combinatorial objects---border rim hook tabloids. Numerous examples are included.
- A bijection proving orthogonality of the characters of \(S_ n\)
- A combinatorial interpretation of the inverse kostka matrix
- Brick tabloids and the connection matrices between bases of symmetric functions
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- Permutation enumeration symmetric functions, and unimodality
- Sequences and inversions
- The combinatorics of symmetric functions and permutation enumeration of the hyperoctahedral group
- The combinatorics of transition matrices between the bases of the symmetric functions and the \(B_ n\) analogues
- The projective representations of the hyperoctahedral group
- Théorie géométrique des polynômes eulériens
- A combinatorial approach to the fusion process for the symmetric group
- Permutation enumeration symmetric functions, and unimodality
- The combinatorics of symmetric functions and permutation enumeration of the hyperoctahedral group
- The permutation enumeration of wreath products \(C_{k}\wr S_{n}\) of cyclic and symmetric groups
- A class of \(q\)-symmetric functions arising from plethysm
- Generating functions for alternating descents and alternating major index
- Symmetric multisets of permutations
- Combinatorics of the group of parity alternating permutations
- Homomorphisms on noncommutative symmetric functions and permutation enumeration
- On the relationship between combinatorial functions and representation theory
- \(q\)-enumeration of Salié permutations
- Descents, inversions, and major indices in permutation groups
- Enumeration of \(m\)-tuples of permutations and a new class of power bases for the space of symmetric functions
- Alternate transition matrices for Brenti's \(q\)-symmetric functions and a class of \((q,t)\)-symmetric functions on the hyperoctahedral group
- scientific article; zbMATH DE number 3877181 (Why is no real title available?)
- 𝑞-Eulerian polynomials: Excedance number and major index
- A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern
- Consecutive up-down patterns in up-down permutations
- Permutation patterns, Stanley symmetric functions, and generalized Specht modules
- Eulerian quasisymmetric functions
- Symmetric functions and generating functions for descents and major indices in compositions
- Permutations and words counted by consecutive patterns
- Alternating permutations and symmetric functions
- The monomial symmetric functions and the Frobenius map
This page was built for publication: Permutation enumeration of the symmetric group and the combinatorics of symmetric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899059)
