Science Fiction and Macdonald's Polynomials
F. Bergeron, G. Garsia
Abstract
This work studies the remarkable relationships that hold among certain m-tuples of the Garsia-Haiman modules Mμ and corresponding elements of the Macdonald basis. We recall that Mμ is defined for a partition μ n, as the linear span of derivatives of a certain bihomogeneous polynomial Δ μ(x,y) in the variables x1,x2,..., xn, y1,y2,..., yn. It has been conjectured by Garsia and Haiman that Mμ has n! dimensions and that its bigraded Frobenius characteristic is given by the symmetric polynomial Hμ(x;q,t)=Σλ n Sλ(X) Kλμ(q,t) where the Kλμ(q,t) are related to the Macdonald q,t-Kostka coefficients Kλμ(q,t) by the identity Kλμ(q,t)=Kλμ(q,1/t)tn(μ) with n(μ) the x-degree of Δ μ(x;y). Computer data has suggested that as ν varies among the immediate predecessors of a partition μ, the spaces Mν behave like a boolean lattice. We formulate a number of remarkable conjectures about the Macdonald polynomials. In particular we obtain a representation theoretical interpretation for some of the symmetries that can be found in the computed tables of q,t-Kostka coefficients.
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.