REVIEW 3 cited by
A combinatorial formula for non-symmetric Macdonald polynomials
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A combinatorial formula for non-symmetric Macdonald polynomials
read the original abstract
We give a combinatorial formula for the non-symmetric Macdonald polynomials E_{\mu}(x;q,t). The formula generalizes our previous combinatorial interpretation of the integral form symmetric Macdonald polynomials J_{\mu}(x;q,t). We prove the new formula by verifying that it satisfies a recurrence, due to Knop, that characterizes the non-symmetric Macdonald polynomials.
Forward citations
Cited by 3 Pith papers
-
Symmetric polynomials: DIM integrable systems versus twisted Cherednik systems
For t = q^{-m}, eigenfunctions from DIM Hamiltonians and twisted Cherednik Hamiltonians combine into identical symmetric functions that are eigenfunctions of both systems simultaneously.
-
Twisted Cherednik spectrum as a $q,t$-deformation
The twisted Cherednik spectrum is a q,t-deformation of the polynomial eigenfunctions built from symmetric ground states and weak-composition excitations at q=1.
-
Integrable systems inspired by DAHA and DIM algebra: type $C^\vee C$ versus type $A$
Type C∨C DAHA and Koornwinder systems mirror type-A Macdonald structures for Hamiltonians, recursions, evaluations and dualities, but lack a usable Noumi-Shiraishi-style universal series and SL(2,Z)-type twisting auto...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.