Rational Parking Functions and LLT Polynomials
classification
🧮 math.CO
math.RT
keywords
rationalcertainpolynomialproveskewcombinatorialcomputedconjecture
read the original abstract
We prove that the combinatorial side of the "Rational Shuffle Conjecture" provides a Schur-positive symmetric polynomial. Furthermore, we prove that the contribution of a given rational Dyck path can be computed as a certain skew LLT polynomial, thus generalizing the result of Haglund, Haiman, Loehr, Remmel and Ulyanov. The corresponding skew diagram is described explicitly in terms of a certain (m,n)-core.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.