This is an old revision of this page, as edited by R.e.b.(talk | contribs) at 15:00, 11 June 2011(Heckman–Opdam polynomial). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 15:00, 11 June 2011 by R.e.b.(talk | contribs)(Heckman–Opdam polynomial)
The Jack function
of integer partition, parameter and
arguments can be recursively defined as
follows:
For m=1
For m>1
where the summation is over all partitions such that the skew partition is a horizontal strip, namely
( must be zero or otherwise ) and
where equals if and otherwise. The expressions and refer to the conjugate partitions of and , respectively. The notation means that the product is taken over all coordinates of boxes in the Young diagram of the partition .
C normalization
The Jack functions form an orthogonal basis in a space of symmetric polynomials. This orthogonality property is unaffected by normalization. The normalization defined above is typically referred to as the J normalization. The C normalization is defined as
When the Jack function is a scalar multiple of the Schur polynomial
where
is the product of all hook lengths of .
Properties
If the partition has more parts than the number of variables, then the Jack function is 0:
Matrix argument
In some texts, especially in random matrix theory, authors have found it more convenient to use a matrix argument in the Jack function. The connection is simple. If is a matrix with eigenvalues
, then
Jack, Henry (1970–1971), "A class of symmetric polynomials with a parameter", Proceedings of the Royal Society of Edinburgh, Section A. Mathematics, 69: 1–18, MR0289462.
Macdonald, I. G. (1995), Symmetric functions and Hall polynomials, Oxford Mathematical Monographs (2nd ed.), New York: Oxford University Press, ISBN0-19-853489-2, MR1354144