Hall polynomial

Hall polynomial

The Hall polynomials in mathematics were developed by Philip Hall in the 1950s in the study of group representations. These polynomials are the structure constants of a certain associative algebra, called the Hall algebra, which plays an important role in the theory of Kashiwara-Lusztig's canonical bases in quantum groups.

Construction

A finite abelian "p"-group "M" is a direct sum of cyclic "p"-power components C_{p^lambda_i}, wherelambda=(lambda_1,lambda_2,ldots) is a partition of n called the "type" of "M". Let g^lambda_{mu, u}(p) be the number of subgroups "N" of "M" such that "N" has type u and the quotient "M/N" has type mu. Hall proved that the functions "g" are polynomial functions of "p" with integer coefficients. Thus we may replace "p" with an indeterminate "q", which results in the Hall polynomials : g^lambda_{mu, u}(q)inmathbb{Z} [q] .

Hall next constructs an associative ring H over mathbb{Z} [q] , now called the Hall algebra. This ring has a basis consisting of the symbols u_lambda and the structure constants of the multiplication in this basis are given by the Hall polynomials:

: u_mu u_ u = sum_lambda g^lambda_{mu, u}(q) u_lambda.

It turns out that "H" is a commutative ring, freely generated by the elements u_{mathbf1^n} corresponding to the elementary "p"-groups. The linear map from "H" to the algebra of symmetric functions defined on the generators by the formula

: u_{mathbf 1^n} mapsto q^{-n(n-1)}e_n

(where "e"n is the "n"th elementary symmetric function) uniquely extends to a ring homomorphism and the images of the basis elements u_lambda may be interpreted via the Hall–Littlewood symmetric functions. Specializing "q" to 1, these symmetric functions become Schur functions, which are thus closely connected with the theory of Hall polynomials.

References

* Ian G. Macdonald, "Symmetric functions and Hall polynomials", (Oxford University Press, 1979) ISBN 0-19-853530-9
* Claus Michael Ringel, "Hall algebras and quantum groups." Invent. Math. 101 (1990), no. 3, 583–591.
* George Lusztig, "Quivers, perverse sheaves, and quantized enveloping algebras." J. Amer. Math. Soc. 4 (1991), no. 2, 365–421.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Hall–Littlewood polynomial — In mathematics, the Hall–Littlewood polynomials encode combinatorial data relating to the representations of the general linear group. They are named for Philip Hall and Dudley E. Littlewood.ee also* Littlewood polynomial * Hall… …   Wikipedia

  • Polynomial arithmetic — includes basic mathematical operations such as addition, subtraction, and multiplication. These operations are defined naturally as if the variable x was an element of S. Division is defined similarly, but requires that S be a field. Examples of… …   Wikipedia

  • Philip Hall — Infobox Scientist name = Philip Hall caption = Philip Hall birth date = birth date|1904|4|11|df=y birth place = Hampstead, London, England death date = death date and age|1982|12|30|1904|4|11|df=y death place = Cambridge, England residence =… …   Wikipedia

  • Symmetric polynomial — This article is about individual symmetric polynomials. For the ring of symmetric polynomials, see ring of symmetric functions. In mathematics, a symmetric polynomial is a polynomial P(X1, X2, …, Xn) in n variables, such that if any of the… …   Wikipedia

  • Power sum symmetric polynomial — In mathematics, specifically in commutative algebra, the power sum symmetric polynomials are a type of basic building block for symmetric polynomials, in the sense that every symmetric polynomial with rational coefficients can be expressed as a… …   Wikipedia

  • Complete homogeneous symmetric polynomial — In mathematics, specifically in algebraic combinatorics and commutative algebra, the complete homogeneous symmetric polynomials are a specific kind of symmetric polynomials. Every symmetric polynomial can be expressed as a polynomial expression… …   Wikipedia

  • Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique …   Wikipedia

  • Elementary symmetric polynomial — In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial P can be expressed as a polynomial in elementary… …   Wikipedia

  • Wilkinson's polynomial — In numerical analysis, Wilkinson s polynomial is a specific polynomial which was used by James H. Wilkinson in 1963 to illustrate a difficulty when finding the root of a polynomial: the location of the roots can be very sensitive to perturbations …   Wikipedia

  • Macdonald polynomial — 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… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”