Comparing formulas for type GL_n Macdonald polynomials -- supplement
From MaRDI portal
Publication:2097192
Abstract: This paper is a supplement to Guo-Ram arXiv:2104.02942, containing examples, remarks and additional material that could be useful to researchers working with Type Macdonald polynomials. In the course of our comparison of the alcove walk formula and the nonattacking fillings formulas for type Macdonald polynomials we did many examples and significant analysis of the literature. In the preparation of Guo-Ram arXiv:2104.02942 it seemed sensible to produce a document with focus and this material was removed. This is paper resurrects and organizes that material, in hopes that others may also find it useful.
Recommendations
- Comparing formulas for type \(GL_n\) Macdonald polynomials
- A combinatorial formula for Macdonald polynomials
- On combinatorial formulas for MacDonald polynomials
- Combinatorial formulas for Macdonald and Hall-Littlewood polynomials
- Compact formulas for Macdonald polynomials and quasisymmetric Macdonald polynomials
Cites work
- 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?)
- A combinatorial formula for nonsymmetric Macdonald polynomials
- Comparing formulas for type \(GL_n\) Macdonald polynomials
- Finite index subgroups of graph products.
- From multiline queues to Macdonald polynomials via the exclusion process
- Matrix product and sum rule for Macdonald polynomials
- Matrix product formula for Macdonald polynomials
- On combinatorial formulas for MacDonald polynomials
- The Quantum Knizhnik-Zamolodchikov Equation and Non-symmetric Macdonald Polynomials
Cited in
(2)
This page was built for publication: Comparing formulas for type \(GL_n\) Macdonald polynomials -- supplement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097192)