A Combinatorial Formula for Nonsymmetric Macdonald Polynomials
By James Haglund, Mark D. Haiman, Nicholas A. Loehr. 2008
129 citations recorded by the source corpus.
Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/0b85700df0abbc55bf2de4ae69f7b9a83d060c2b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
- Sarah K. Mason
- Daniel Bump
- Ben Brubaker
- Arun Ram
- Martha Yip
- Anthony M. Licata
- James Haglund
- I. Gordon
In Discrete Mathematics and Combinatorics
- Sarah K. Mason
- Daniel Bump
- Ben Brubaker
- Arun Ram
- Martha Yip
- Anthony M. Licata
- James Haglund
- Gautam Chinta
In Geometry and Topology
- Sarah K. Mason
- Daniel Bump
- Ben Brubaker
- Arun Ram
- Martha Yip
- Anthony M. Licata
- Aaron D. Lauda
- Sabin Cautis
Citations in the corpus
- An explicit construction of type A Demazure atoms (2007, methodology): “The combinatorial formula for nonsymmetric Macdonald polynomials provided by Haglund, Haiman, and Loehr [2] can be specialized in this manner to obtain a combinatorial formula for Eγ (X;0,0).”
- A combinatorial formula for Macdonald polynomials (2008, methodology): “These expansions, when applied to the generator of the polynomial representation of the DAHA, give formulas for the Macdonald polynomials which are generalizations, to all root systems, of the formulas obtained by Haglund-Haiman-Loehr [HHL1] [ HHL2 ] in type GLn.”
- Whittaker functions and Demazure operators (2011, methodology): “As described above, Cherednik gave a double affine Hecke algebra action on the weight ring Q[q, t] ⊗ O(T̂ ), which is used to define a recursion for nonsymmetric Macdonald polynomials [10, 14].”