## More Kostka Numbers

First let’s mention a few more general results about Kostka numbers.

Among all the tableaux that partition , it should be clear that . Thus the Kostka number is not automatically zero. In fact, I say that it’s always . Indeed, the shape is a single row with entries, and the content gives us a list of numbers, possibly with some repeats. There’s exactly one way to arrange this list into weakly increasing order along the single row, giving .

On the other extreme, , so might be nonzero. The shape is given by , and the content gives one entry of each value from to . There are no possible entries to repeat, and so any semistandard tableau with content is actually standard. Thus — the number of standard tableaux of shape .

This means that we can decompose the module :

But , which means each irreducible -module shows up here with a multiplicity equal to its dimension. That is, is always the left regular representation.

Okay, now let’s look at a full example for a single choice of . Specifically, let . That is, we’re looking for semistandard tableaux of various shapes, all with two entries of value , two of value , and one of value . There are five shapes with . For each one, we will look for all the ways of filling it with the required content.

Counting the semistandard tableaux on each row, we find the Kostka numbers. Thus we get the decomposition

Realy good, Complete: allows translation into programming (Mathematica).

Thanks, John.

Comment by Wouter | January 15, 2012 |