Abstract
AbstractWe generalize the shuffle theorem and its$(km,kn)$version, as conjectured by Haglund et al. and Bergeron et al. and proven by Carlsson and Mellit, and Mellit, respectively. In our version the$(km,kn)$Dyck paths on the combinatorial side are replaced by lattice paths lying under a line segment whosexandyintercepts need not be integers, and the algebraic side is given either by a Schiffmann algebra operator formula or an equivalent explicit raising operator formula. We derive our combinatorial identity as the polynomial truncation of an identity of infinite series of$\operatorname {\mathrm {GL}}_{l}$characters, expressed in terms of infinite series versions of LLT polynomials. The series identity in question follows from a Cauchy identity for nonsymmetric Hall–Littlewood polynomials.
Publisher
Cambridge University Press (CUP)
Subject
Discrete Mathematics and Combinatorics,Geometry and Topology,Mathematical Physics,Statistics and Probability,Algebra and Number Theory,Analysis
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献