A Combinatorial Formula for the Character of the Diagonal Coinvariants
J. Haglund, M. Haiman, N. Loehr, J. B. Remmel, A. Ulyanov
Abstract
Let Rn be the ring of coinvariants for the diagonal action of the symmetric group Sn. It is known that the character of Rn as a doubly-graded Sn module can be expressed using the Frobenius characteristic map as ∇ en, where en is the n-th elementary symmetric function, and ∇ is an operator from the theory of Macdonald polynomials. We conjecture a combinatorial formula for ∇ en and prove that it has many desirable properties which support our conjecture. In particular, we prove that our formula is a symmetric function (which is not obvious) and that it is Schur positive. These results make use of the theory of ribbon tableau generating functions of Lascoux, Leclerc and Thibon. We also show that a variety of earlier conjectures and theorems on ∇ en are special cases of our conjecture. Finally, we extend our conjectures on ∇ en and several of the results supporting them to higher powers ∇m en.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.