The combinatorics of symmetric functions and permutation enumeration of the hyperoctahedral group
From MaRDI portal
Publication:1356523
DOI10.1016/0012-365X(95)00326-RzbMath0881.05119MaRDI QIDQ1356523
Publication date: 15 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
05E05: Symmetric functions and generalizations
05E10: Combinatorial aspects of representation theory
Related Items
Symmetric functions and generating functions for descents and major indices in compositions, 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers, Permutation enumeration of the symmetric group and the combinatorics of symmetric functions, The combinatorics of transition matrices between the bases of the symmetric functions and the \(B_ n\) analogues, Generating functions for alternating descents and alternating major index, 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, New equivalences for pattern avoiding involutions
Cites Work
- Unnamed Item
- \(\lambda\)-rings and the representation theory of the symmetric group
- On the eigenvalues of representations of reflection groups and wreath products
- Brick tabloids and the connection matrices between bases of symmetric functions
- The projective representations of the hyperoctahedral group
- Permutation enumeration symmetric functions, and unimodality
- Signed permutation statistics and cycle type
- Descents and one-dimensional characters for classical Weyl groups
- Permutation enumeration of the symmetric group and the combinatorics of symmetric functions
- The combinatorics of transition matrices between the bases of the symmetric functions and the \(B_ n\) analogues
- A combinatorial interpretation of the inverse kostka matrix
- On the Foundations of Combinatorial Theory. VII: Symmetric Functions through the Theory of Distribution and Occupancy