Jump to content

Jack function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Plamenkoev (talk | contribs) at 00:16, 30 December 2006 (Created page with 'In mathematics, the Jack function is a homogeneous, symmetric polynomial which generalizes the Schur polynomial. ==Definition== The Jack function <math>J_\kap...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, the Jack function is a homogeneous, symmetric polynomial which generalizes the Schur polynomial.


Definition

The Jack function of integer partition , parameter and arguments can be recursively defined as follows:

  • For  :
  • For :
where the summation is over all partitions such that for all (this is what the expression means) 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 .

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


References

  • James Demmel and Plamen Koev, "Accurate and efficient evaluation of Schur and Jack functions", Math. Comp., 75, no. 253, 223–239, 2005.
  • I. G. Macdonald, Symmetric functions and Hall polynomials, Second ed., Oxford University Press, New York, 1995.
  • Richard Stanley, "Some combinatorial properties of Jack symmetric functions", Adv. Math., 77, no. 1, 76–115, 1989.