Kostka number explained

In mathematics, the Kostka number

K _{λ} (depending on two integer partitions λ and \mu ) is a non-negative integer that is equal to the number of semistandard Young tableaux of shape λ and weight \mu . They were introduced by the mathematician Carl Kostka in his study of symmetric functions .^[1]

For example, if

λ = ( 3 , 2 ) and \mu = ( 1 , 1 , 2 , 1 ) , the Kostka number K _{λ} counts the number of ways to fill a left-aligned collection of boxes with 3 in the first row and 2 in the second row with 1 copy of the number 1, 1 copy of the number 2, 2 copies of the number 3 and 1 copy of the number 4 such that the entries increase along columns and do not decrease along rows. The three such tableaux are shown at right, and K _{(3,} = 3 .

Examples and special cases

For any partition

λ , the Kostka number K _{λ} is equal to 1: the unique way to fill the Young diagram of shape λ = ( λ _{1,...c,λ} _{m)} with λ _{1} copies of 1, λ _{2} copies of 2, and so on, so that the resulting tableau is weakly increasing along rows and strictly increasing along columns is if all the 1s are placed in the first row, all the 2s are placed in the second row, and so on. (This tableau is sometimes called the Yamanouchi tableau of shape λ .)

The Kostka number

K _{λ} is positive (i.e., there exist semistandard Young tableaux of shape λ and weight \mu ) if and only if λ and \mu are both partitions of the same integer n and λ is larger than \mu in dominance order.^[2]

In general, there are no nice formulas known for the Kostka numbers. However, some special cases are known. For example, if

\mu = ( 1 , 1 , ... c, 1 ) is the partition whose parts are all 1 then a semistandard Young tableau of weight \mu is a standard Young tableau; the number of standard Young tableaux of a given shape λ is given by the hook-length formula.

Properties

An important simple property of Kostka numbers is that

K _{λ} does not depend on the order of entries of \mu . For example, K _{(3,2)} = K _{(3,2)} . This is not immediately obvious from the definition but can be shown by establishing a bijection between the sets of semistandard Young tableaux of shape λ and weights \mu and \mu ^{\prime} , where \mu and \mu ^{\prime} differ only by swapping two entries.^[3]

Kostka numbers, symmetric functions and representation theory

s _{λ} as a linear combination of monomial symmetric functions m _{\mu} :s _{λ=} \sum _{\mu} K _{λ} m _{\mu,}

where

λ and \mu are both partitions of n . Alternatively, Schur polynomials can also be expressed^[4] ass _{λ=} \sum _{\alpha} K _{λ} x ^{\alpha,} \alpha of n and x ^{\alpha} denotes the monomial x ^{\alpha _{1}} _{1} x ^{\alpha _{2}} _{2} ... c x ^{\alpha _{n}} _{n} .S _{n} , Kostka numbers express the decomposition of the permutation module M _{\mu} in terms of the irreducible representations V _{λ} where λ is a partition of n , i.e.,M _{\mu} = o plus _{λ} K _{λ} V _{λ.} GL _{d(C)} , the Kostka number K _{λ} also counts the dimension of the weight space corresponding to \mu in the unitary irreducible representation U _{λ} (where we require \mu and λ to have at most d parts).

Examples

The Kostka numbers for partitions of size at most 3 are as follows:

K _{\varnothing} = 1 , K _{(1)} = 1 , K _{(2)} = K _{(2)} = 1 , K _{(1,1)} = 0 , K _{(1,1)} = 1 , K _{(3)} = K _{(3)} = K _{(3)} = 1 , K _{(2,1)} = 0 , K _{(2,1)} = 1 , K _{(2,1)} = 2 , K _{(1,1,1)} = K _{(1,1,1)} = 0 , K _{(1,1,1)} = 1 .

These values are exactly the coefficients in the expansions of Schur functions in terms of monomial symmetric functions:

s _{\varnothing} = m _{\varnothing} = 1 s _{(1)} = m _{(1)} s _{(2)} = m _{(2)} + m _{(1,1)} s _{(1,1)} = m _{(1,1)} s _{(3)} = m _{(3)} + m _{(2,1)} + m _{(1,1,1)} s _{(2,1)} = m _{(2,1)} + 2 m _{(1,1,1)} s _{(1,1,1)} = m _{(1,1,1)}

gave tables of these numbers for partitions of numbers up to 8.

Generalizations

Kostka numbers are special values of the 1 or 2 variable Kostka polynomials:

K _{λ\mu} = K _{λ\mu} ( 1 ) = K _{λ\mu} ( 0 , 1 ).

Notes and References

1. Stanley, Enumerative combinatorics, volume 2, p. 398.
2. Stanley, Enumerative combinatorics, volume 2, p. 315.
3. Stanley, Enumerative combinatorics, volume 2, p. 311.
4. Stanley, Enumerative combinatorics, volume 2, p. 311.