Matrix product and sum rule for Macdonald polynomials
We present a new, explicit sum formula for symmetric Macdonald polynomials Pλ and show that they can be written as a trace over a product of (infinite dimensional) matrices. These matrices satisfy the Zamolodchikov– Faddeev (ZF) algebra. We construct solutions of the ZF algebra from a rank-reduced v...
Main Authors: | Luigi Cantini, Jan De Gier, Michael Wheeler |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2020-04-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6419/pdf |
Similar Items
-
A bijective proof of Macdonald's reduced word formula
by: Sara Billey, et al.
Published: (2020-04-01) -
A combinatorial approach to Macdonald q, t-symmetry via the Carlitz bijection
by: Maria Monks Gillespie
Published: (2020-04-01) -
Schur polynomials and matrix positivity preservers
by: Alexander Belton, et al.
Published: (2020-04-01) -
Kraskiewicz-Pragacz modules and Pieri and dual Pieri rules for Schubert polynomials
by: Masaki Watanabe
Published: (2020-04-01) -
Some results on counting roots of polynomials and the Sylvester resultant.
by: Michael Monagan, et al.
Published: (2020-04-01)