The delta conjecture

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We conjecture two combinatorial interpretations for the symmetric function ∆eken, where ∆f is an eigenoperator for the modified Macdonald polynomials defined by Bergeron, Garsia, Haiman, and Tesler. Both interpretations can be seen as generalizations of the Shuffle Conjecture, a statement originally conjectured by Haglund, Haiman, Remmel, Loehr, and Ulyanov and recently proved by Carlsson and Mellit. We show how previous work of the second and third authors on Tesler matrices and ordered set partitions can be used to verify several cases of our conjectures. Furthermore, we use a reciprocity identity and LLT polynomials to prove another case. Finally, we show how our conjectures inspire 4-variable generalizations of the Catalan numbers, extending work of Garsia, Haiman, and the first author.

Cite

CITATION STYLE

APA

Haglund, J., Remmel, J. B., & Wilson, A. T. (2016). The delta conjecture. In Discrete Mathematics and Theoretical Computer Science (pp. 611–622). Discrete Mathematics and Theoretical Computer Science. https://doi.org/10.46298/dmtcs.6384

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free