Macdonald polynomial

From Wikipedia, the free encyclopedia

In mathematics, Macdonald polynomials P_λ are a two-parameter family of orthogonal polynomials indexed by a positive weight λ of a root system, introduced by Ian G. Macdonald (1987). They generalize several other families of orthogonal polynomials, such as Jack polynomials and Hall-Littlewood polynomials. They have deep relationships with affine Hecke algebras and Hilbert schemes, which were used to prove several conjectures made by Macdonald about them.

1 Definition
2 Examples
3 The Macdonald constant term conjecture
4 The Macdonald positivity conjecture
5 External links
6 References

[edit] Definition

First fix some notation:

R is a finite root system with a fixed Weyl chamber in a real vector space V.
W is the Weyl group of R
Q is the root lattice of R (the lattice spanned by the roots).
P is the weight lattice of R (containing Q)
P⁺ is the set of dominant weights: the elements of P in the Weyl chamber.
F is a field of characteristic 0.
A = F(P) is the group algebra of P, with a basis of elements written e^λ for λ∈P
If f = e^λ, then f′ means e^−λ.
m_μ = Σ_λ∈Wμe^λ is an orbit sum; these elements form a basis for the subalgebra A^W of elements fixed by W.
$(a;q)_\infty = \prod_{r\ge0}(1-aq^r)$ , a formal power series in q.
$\Delta= \prod_{\alpha\in R} {(e^\alpha; q)_\infty \over (te^\alpha; q)_\infty}$
The inner product 〈f,g〉 of two elements of A is defined to be

〈f,g〉 = (constant term of fg′Δ)/|W|

at least when t is a positive integer power of q.

The Macdonald polynomials P_λ for λ∈P⁺ are uniquely defined by the following two conditions:

$P_\lambda=\sum_{\mu\le \lambda}u_{\lambda\mu}m_\mu$ where u_λμ is a rational function of q and t with u_λλ = 1.

P_λ and P_μ are orthogonal if λ<μ

In other words the Macdonald polynomials are obtained by orthogonalizing the obvious basis for A^W. The existence of polynomials with these properties is easy to show (for any inner product). A key property of the Macdonald polynomials is that they are orthogonal: 〈P_λ, P_μ〉 = 0 whenever λ≠μ. This is not a trivial consequence of the definition because P⁺ is not totally ordered, so has plenty of elements that are incomparable, and one has to check that the corresponding polynomials are still orthogonal.

[edit] Examples

If q = t the Macdonald polynomials become the Weyl character of the representations of the compact group of the root system, or the Schur functions in the case of root systems of type A.
If q = 0 the Macdonald polynomials become the (rescaled) zonal spherical functions for a semisimple p-adic group, or Hall-Littlewood polynomials when the roots system has type A.
If t=1 the Macdonald polynomials become the sums over W orbits, which are monomial symmetric functions when the root system has type A.
If we put t = q^α and let q tend to 1 the Macdonald polynomials become Jack polynomials when the root system is of type A.
If (1 − t) = k(1 − q) for some constant k and q is then set equal to 1 the Macdonald polynomials become the Jacobi polynomials P_λ(k) associated to a root system by Heckman and Opdam. For root systems of type A these are essentially the Jack polynomials mentioned above.

[edit] The Macdonald constant term conjecture

If t = q^k for some positive integer k, then the norm of the Macdonald polynomials is given by

$\langle P_\lambda, P_\lambda\rangle = \prod_{\alpha\in R, \alpha>0} \prod_{0<i<k} {1-q^{(\lambda+k\rho,\alpha^v)+i} \over 1-q^{(\lambda+k\rho,\alpha^v)-i}}.$

This was conjectured by Macdonald (1982), and proved for all root systems by Cherednik (1995).

[edit] The Macdonald positivity conjecture

In the case of roots systems of type A_n−1 the Macdonald polynomials can be identified with symmetric polynomials in n variables (with coefficients that are rational functions of q and t). They can be expanded in terms of Schur functions, and the coefficients K_λμ(q,t) of these expansions are called Kostka-Macdonald coefficients. Macdonald conjectured that the Kostka-Macdonald coefficients were polynomials in q and t with non-negative integer coefficients. These conjectures are now proved; the hardest and final step was proving the positivity, which was done by Mark Haiman (2001).

The n! conjecture states that for each partition μ of n the space

$D_\mu =C[\partial x,\partial y]\Delta_\mu$

spanned by all higher partial derivatives of

$\Delta_\mu = \det (x_i^{p_i}y_i^{p_j})_{1\le i,j,\le n}$

has dimension n!, where (p_j, q_j) run through the n elements of the diagram of the partition μ, regarded as a subset of the pairs of positive integers.

Haiman's proof of the Macdonald positivity conjecture and the n! conjecture involved showing that the isospectral Hilbert scheme of n points in a plane was Cohen-Macaulay (and even Gorenstein). Earlier results of Haiman and Garsia had already shown that this implied the n! conjecture and implied that the Kostka-Macdonald coefficients were graded character multiplicities for the modules D_μ. This immediately implies the Macdonald positivity conjecture because character multiplicities have to be non-negative integers.

Ian Grojnowski and Mark Haiman found another proof of the Macdonald positivity conjecture by proving a positivity conjecture for LLT polynomials.

[edit] External links

Garsia's page about Macdonald polynomials.
Some of Haiman's Haiman's papers about Macdonald polynomials.

[edit] References

Ivan Cherednik, Double Affine Hecke Algebras and Macdonald's Conjectures The Annals of Mathematics > 2nd Ser., Vol. 141, No. 1 (Jan., 1995), pp. 191-216
Mark Haiman Combinatorics, symmetric functions, and Hilbert schemes Current Developments in Mathematics 2002, no. 1 (2002), 39-111.
Haiman, Mark Notes on Macdonald polynomials and the geometry of Hilbert schemes. Symmetric functions 2001: surveys of developments and perspectives, 1--64, NATO Sci. Ser. II Math. Phys. Chem., 74, Kluwer Acad. Publ., Dordrecht, 2002.MR 2005f:14010
Mark Haiman Hilbert schemes, polygraphs, and the Macdonald positivity conjecture J. Amer. Math. Soc. 14 (2001), 941-1006
Macdonald, I. G. Some conjectures for root systems, SIAM J. Math. Anal. 13 (1982) 988-1007. DOI:10.1137/0513070
Macdonald, I. G. Affine Hecke algebras and orthogonal polynomials. Cambridge Tracts in Mathematics, 157. Cambridge University Press, Cambridge, 2003. x+175 pp. ISBN 0-521-82472-9 DOI:10.2277/0521824729 MR 2005b:33021
Macdonald, I. G. Symmetric functions and Hall polynomials. Second edition. Oxford Mathematical Monographs. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1995. x+475 pp. ISBN 0-19-853489-2 MR 96h:05207
Macdonald, I. G. Symmetric functions and orthogonal polynomials. Dean Jacqueline B. Lewis Memorial Lectures presented at Rutgers University, New Brunswick, NJ. University Lecture Series, 12. American Mathematical Society, Providence, RI, 1998. xvi+53 pp. ISBN 0-8218-0770-6 MR 99f:05116
Macdonald, I. G. Affine Hecke algebras and orthogonal polynomials. Seminaire Bourbaki 797 (1995).
Macdonald, I. G. Orthogonal polynomials associated with root systems. 1987 preprint, later published in Sém. Lothar. Combin. 45 (2000/01), Art. B45a, MR 2002a:33021

Retrieved from "http://en.wikipedia.org../../../m/a/c/Macdonald_polynomial.html"

Categories: Combinatorics | Algebraic geometry | Orthogonal polynomials

Macdonald polynomial

From Wikipedia, the free encyclopedia

Contents

[edit] Definition

[edit] Examples

[edit] The Macdonald constant term conjecture

[edit] The Macdonald positivity conjecture

[edit] External links

[edit] References

Views

Navigation

interaction

Search