Comparing formulas for type GL_n Macdonald polynomials
From MaRDI portal
Publication:2097191
Abstract: The paper compares (and reproves) the alcove walk and the nonattacking fillings formulas for type Macdonald polynomials which were given in Haglund-Haiman-Loehr arXiv:math.CO/0601693, Alexandersson arXiv:1602.05153 and Ram-Yip arXiv:0803.1146. The "compression" relating the two formulas in this paper is the same as that of Lenart arXiv:0804.4716. We have reformulated it so that it holds without conditions and so that the proofs of the alcove walk formula and the nonattacking fillings formula are parallel. This reformulation highlights the role of the double affine Hecke algebra and Cherednik's intertwiners. An exposition of the type double affine braid group, double affine Hecke algebra, and all definitions and proofs regarding Macdonald polynomials are provided to make this paper self contained.
Recommendations
- Comparing formulas for type \(GL_n\) Macdonald polynomials -- supplement
- A combinatorial formula for Macdonald polynomials
- On combinatorial formulas for MacDonald polynomials
- Combinatorial formulas for Macdonald and Hall-Littlewood polynomials
- Hall-Littlewood polynomials, alcove walks, and fillings of Young diagrams
Cites work
- scientific article; zbMATH DE number 1713119 (Why is no real title available?)
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- scientific article; zbMATH DE number 1003131 (Why is no real title available?)
- scientific article; zbMATH DE number 1963972 (Why is no real title available?)
- scientific article; zbMATH DE number 2148963 (Why is no real title available?)
- scientific article; zbMATH DE number 846189 (Why is no real title available?)
- scientific article; zbMATH DE number 972692 (Why is no real title available?)
- A combinatorial formula for Macdonald polynomials
- A combinatorial formula for nonsymmetric Macdonald polynomials
- A recursion and a combinatorial formula for Jack polynomials
- Affine Hecke algebras and generalized standard Young tableaux.
- Comparing formulas for type \(GL_n\) Macdonald polynomials -- supplement
- From multiline queues to Macdonald polynomials via the exclusion process
- Generalized Weyl modules and nonsymmetric \(q\)-Whittaker functions
- Integrality of two variable Kostka functions.
- On combinatorial formulas for MacDonald polynomials
Cited in
(5)- From fermionic spin-Calogero-Sutherland models to the Haldane-Shastry chain by freezing
- \(c\)-functions and Macdonald polynomials
- Monk rules for type \(\mathrm{GL}_n\) Macdonald polynomials
- A combinatorial formula for Macdonald polynomials
- Comparing formulas for type \(GL_n\) Macdonald polynomials -- supplement
This page was built for publication: Comparing formulas for type \(GL_n\) Macdonald polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097191)