HOME: |
![]() |
Mark Haiman
first announced a proof of the n!-conjecture at
the 1999 CMS winter
meeting in Montreal there were still gaps in this proof and he was
fortunately able to complete it later.
One announcement made by Adriano Garsia at the Winter Meeting in Montreal is that he is still offering a prize of $1000 for the first mathematician who can produce bases for the n! modules. Mark's result implies that such a basis exists but is not constructive in its nature. |
A Short Explanation of the n! Theorem |
For any partition
![]() ![]() ![]() where the
|
Example: Consider the partition
|
Note that because this is a determinant, when an element of the symmetric group acts on this polynomial by permuting the x and the y variables simultaneously it permutes the columns, hence the action of the symmetric group on this polynomial is: |
|
Consider the linear span of all of the derivatives of
this polynomial with respect to the variables
![]() ![]() ![]() ![]() ![]() |
The n! Theorem states that
It is a theorem by Garsia/Haiman that the dimension is less than or equal to n! |
Example: Because n! grows
so quickly it is difficult to effectivly demonstrate an example of anything
larger than 3. In this case we will choose
![]() |
Consider all of the polynomials listed
below, along with
![]() ![]()
|
The connection with the Macdonald polynomials comes when
one considers the graded character of this module.
Let
Then define
|
A refined statement of the n! Conjecture is then
that
where
|
In our example above, if you are familiar with the representation
of the symmetric group, it is not hard to see that the Frobenius image
of the graded representation of this module is
since the polynomial
|