A combinatorial proof of a recursion for the \(q\)-Kostka polynomials

DOI10.1006/jcta.1999.3041zbMath0959.05117OpenAlexW2091970114MaRDI QIDQ1586125

Kendra Killpatrick

Publication date: 20 April 2001

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.3041

zbMATH Keywords

symmetric functionchargerepresentations of the symmetric groupKostka numberssemistandard tableaucyclageYoung's rule

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Representations of finite symmetric groups (20C30) Combinatorics of partially ordered sets (06A07)

Related Items

Combinatorics of crystal graphs and Kostka-Foulkes polynomials for the root systems \(B_{n}\), \(C_{n}\) and \(D_{n}\) ⋮ A combinatorial approach to the \(q,t\)-symmetry relation in Macdonald polynomials ⋮ Unnamed Item

Cites Work

• On certain graded \(S_ n\)-modules and the \(q\)-Kostka polynomials
• Permutations, matrices, and generalized Young tableaux
• Subgroup lattices and symmetric functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item