Macdonald polynomials and cyclic sieving
From MaRDI portal
Publication:2066001
DOI10.1016/j.ejc.2021.103465zbMath1480.05139arXiv2102.09982OpenAlexW3211494759MaRDI QIDQ2066001
Publication date: 13 January 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.09982
Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05)
Related Items (1)
Cites Work
- Hall-Littlewood polynomials and fixed point enumeration
- A Schensted algorithm for rim hook tableaux
- On certain graded \(S_ n\)-modules and the \(q\)-Kostka polynomials
- Green polynomials and Hall-Littlewood functions at roots of unity
- Ordered set partitions, generalized coinvariant algebras, and the delta conjecture
- Regular elements of finite reflection groups
- The cyclic sieving phenomenon
- Some natural bigraded \(S_ n\)-modules and \(q,t\)-Kostka coefficients
- Cyclic sieving, skew Macdonald polynomials and Schur positivity
- Factorization formulas for Macdonald polynomials
- Hilbert schemes, polygraphs and the Macdonald positivity conjecture
- Bimahonian distributions
- Ribbon tableaux, Hall–Littlewood functions, quantum affine algebras, and unipotent varieties
- A combinatorial formula for Macdonald polynomials
- A graded representation model for Macdonald's polynomials.
- Ordered set partitions, Garsia-Procesi modules, and rank varieties
- A new class of symmetric functions
This page was built for publication: Macdonald polynomials and cyclic sieving