Hall–Littlewood Polynomials
   HOME

TheInfoList



OR:

In mathematics, the Hall–Littlewood polynomials are
symmetric function In mathematics, a function of n variables is symmetric if its value is the same no matter the order of its arguments. For example, a function f\left(x_1,x_2\right) of two arguments is a symmetric function if and only if f\left(x_1,x_2\right) = f ...
s depending on a parameter ''t'' and a
partition Partition may refer to: Computing Hardware * Disk partitioning, the division of a hard disk drive * Memory partition, a subdivision of a computer's memory, usually for use by a single job Software * Partition (database), the division of a ...
λ. They are Schur functions when ''t'' is 0 and monomial symmetric functions when ''t'' is 1 and are special cases of
Macdonald polynomials In mathematics, Macdonald polynomials ''P''λ(''x''; ''t'',''q'') are a family of orthogonal symmetric polynomials in several variables, introduced by Macdonald in 1987. He later introduced a non-symmetric generalization in 1995. Macdonald origi ...
. They were first defined indirectly by
Philip Hall Philip Hall FRS (11 April 1904 – 30 December 1982), was an English mathematician. His major work was on group theory, notably on finite groups and solvable groups. Biography He was educated first at Christ's Hospital, where he won the Thomps ...
using the
Hall algebra In mathematics, the Hall algebra is an associative algebra with a basis corresponding to isomorphism classes of finite abelian p-group, ''p''-groups. It was first discussed by but forgotten until it was rediscovered by , both of whom published no ...
, and later defined directly by Dudley E. Littlewood (1961).


Definition

The Hall–Littlewood polynomial ''P'' is defined by :P_\lambda(x_1,\ldots,x_n;t) = \left( \prod_ \prod_^ \frac \right) , where λ is a partition of at most ''n'' with elements λ''i'', and ''m''(''i'') elements equal to ''i'', and ''S''''n'' is the
symmetric group In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group ...
of order ''n''!. As an example, : P_(x_1,x_2;t) = x_1^4 x_2^2 + x_1^2 x_2^4 + (1-t) x_1^3 x_2^3


Specializations

We have that P_\lambda(x;1) = m_\lambda(x), P_\lambda(x;0) = s_\lambda(x) and P_\lambda(x;-1) = P_\lambda(x) where the latter is the Schur ''P'' polynomials.


Properties

Expanding the
Schur polynomials In mathematics, Schur polynomials, named after Issai Schur, are certain symmetric polynomials in ''n'' variables, indexed by partitions, that generalize the elementary symmetric polynomials and the complete homogeneous symmetric polynomials. In r ...
in terms of the Hall–Littlewood polynomials, one has : s_\lambda(x) = \sum_\mu K_(t) P_\mu(x,t) where K_(t) are the Kostka–Foulkes polynomials. Note that as t=1, these reduce to the ordinary Kostka coefficients. A combinatorial description for the Kostka–Foulkes polynomials was given by Lascoux and Schützenberger, :K_(t) = \sum_ t^ where "charge" is a certain combinatorial statistic on semistandard Young tableaux, and the sum is taken over all semi-standard Young tableaux with shape ''λ'' and type ''μ''.


See also

* Hall polynomial


References

* *


External links

* {{DEFAULTSORT:Hall-Littlewood polynomials Orthogonal polynomials Algebraic combinatorics Symmetric functions