- N!-conjecture
In mathematics, the n! conjecture is the
conjecture that thedimension of a certainbi-graded module ofdiagonal harmonics is . It was made byA. M. Garsia and proved byM. Haiman . It implies Macdonald's positivity conjecture about hisMacdonald polynomial s.Formulation
The
Macdonald polynomial s:"P"λ
are a two-parameter family of
orthogonal polynomials indexed by a positive weight λ of aroot system , introduced byIan G. Macdonald (1987). They generalize several other families of orthogonal polynomials, such asJack polynomial s andHall–Littlewood polynomial s. They are known to have deep relationships withaffine Hecke algebra s andHilbert scheme s, which were used to prove several conjectures made by Macdonald about them.In 1988, Macdonald (see [5] ) introduced a new basis for the space of
symmetric function s, which specializes to many of the well-known bases for the symmetric functions, by suitable substitutions for the parameters "q" and "t".In fact, we can obtain in this manner the
Schur function s, the Hall-Littlewood symmetric functions, the Jack symmetric functions, thezonal symmetric function s, thezonal spherical function s, and the elementary and monomial symmetric functions.The so called ("q","t")-
Kostka polynomial s are the coefficients of a resultingtransition matrix . Macdonald conjectured that they are polynomials in "q" and "t", with non-negative integer coefficients.The approach of Garsia and Haiman
It was
Adriano Garsia 's idea to construct an appropriate module in order to prove positivity (as was done in his previous joint work with Procesi on Schur positivity ofKostka-Foulkes polynomials ).In an attempt to prove Macdonald's conjecture, Garsia and Haiman (see [2] ) introduced the bi-graded module
:
of
diagonal harmonic s and conjectured that the (modified) Macdonald polynomials are the Frobenius image of the character generating function of , under the diagonal action of thesymmetric group .The proof of Macdonald's conjecture was then reduced to the n! conjecture; i.e., to prove that the dimension of is n!. In 2001, Haiman proved that the dimension is indeed n! (see [4] ). Thanks to this piece of work (Hilbert schemes played a key role in the solution) Haiman was named full professor in UC Berkeley.
This breakthrough led to the discovery of many hidden connections and new aspects of
symmetric group representation theory , as well as combinatorial objects (e.g., insertion tableaux, Haglund's inversion numbers, the role of parking functions in representation theory etc. etc.).References
* [1] A. M. Garsia and C. Procesi, On certain graded "S""n"-modules and the q-Kostka polynomials, "Adv. Math." 94 (1992), 82–138.
* [2] A. M. Garsia and M. Haiman, A graded repesentation model for the Macdonald polynomials, "Proc. Nat. Acad. Sci." 90 (1993), 3607–3610.
* [3] A. M. Garsia and M. Haiman, "Orbit Harmonics and Graded Representations, Research Monograph" to appear as part of the collection published by the Lab. de. Comb. et Informatique Math'ematique, edited by S. Brlek, U. du Qu'ebec 'a Montr'eal.
* [4] M. Haiman, Hilbert schemes, polygraphs, and the Macdonald positivity conjecture, J. Amer. Math. Soc. 14 (2001), 941–1006.
* [5] I. G. Macdonald, A new class of symmetric functions, Publ. I.R.M.A. Strasbourg, Actes 20"e" S'eminaire Lotharingien (1988), 131–171.
External links
* [http://bergeron.math.uqam.ca/conjecture_fact.html n! conjecture] by François Bergeron
* [http://www.math.ucsd.edu/~garsia/schur/ n! homepage] of Garsia
Wikimedia Foundation. 2010.