Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematical Object

Schur Polynomial

Algebra

Schur polynomials are a family of symmetric polynomials in n variables, indexed by integer partitions, that generalize the elementary symmetric polynomials and the complete homogeneous symmetric polynomials. Named after the mathematician Issai Schur, they form a linear basis for the space of all symmetric polynomials of a given degree. In representation theory, Schur polynomials serve as the characters of the irreducible polynomial representations of the general linear group, linking algebraic combinatorics to group representation theory. They are formally defined through Jacobi's bialternant formula, which expresses a Schur polynomial as the ratio of two alternating polynomials, with the denominator equal to the Vandermonde determinant. When two Schur polynomials are multiplied together, the product can be written as a linear combination of other Schur polynomials with non-negative integer coefficients, a rule known as the Littlewood-Richardson rule, and a related family called skew Schur polynomials extends the same structure to pairs of partitions.

Facts
Classification
Object Kind
Function 1
Connections

Attributed To

Source Schur Polynomial (Wikipedia)

In Branch

Source Schur Polynomial (Wikipedia)

Is Kind Of Object

Functions, Concepts
Sources
1. Schur Polynomial (Wikipedia)
  • Lead section
    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.
  • Attributed To: Issai Schur, Lead paragraph
    In mathematics, Schur polynomials, named after Issai Schur, are certain symmetric polynomials in n variables, indexed by partitions, that generalize
  • In Branch: Representation Theory, Lead paragraph
    In representation theory they are the characters of polynomial irreducible representations of the general linear groups.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.