A bijective proof of a factorization formula for specialized Macdonald polynomials
From MaRDI portal
Publication:1929753
DOI10.1007/s00026-012-0162-5zbMath1256.05022OpenAlexW2101988350WikidataQ114231916 ScholiaQ114231916MaRDI QIDQ1929753
Elizabeth Niese, Nicholas A. Loehr
Publication date: 9 January 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-012-0162-5
Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05)
Related Items (4)
Modified Macdonald polynomials and the multispecies zero-range process. I ⋮ Compact formulas for Macdonald polynomials and quasisymmetric Macdonald polynomials ⋮ Compact formulas for Macdonald polynomials and quasisymmetric Macdonald polynomials ⋮ A Combinatorial Approach to the Symmetry of $q,t$-Catalan Numbers
Cites Work
- Unnamed Item
- Unnamed Item
- A remarkable \(q,t\)-Catalan sequence and \(q\)-Lagrange inversion
- Factorization formulas for Macdonald polynomials
- A bijective proof of a factorization formula for Macdonald polynomials at roots of unity
- A combinatorial formula for Macdonald polynomials
- Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula
- A combinatorial model for the Macdonald polynomials
- On the Netto Inversion Number of a Sequence
- A new class of symmetric functions
This page was built for publication: A bijective proof of a factorization formula for specialized Macdonald polynomials