MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The Hook lenght formula gives the number of standard Young tableaux on a given diagram.

A variant gives the number of semistandard tableuax.

Does there exist a formula for counting "weighted tableaux"? By weighted tableaux I mean that there exists a vector $(a_1,\dots,a_n)$ and I only want to count the tableaux with entries in $\{1,\dots,n\}$ such that $i$ appears exactly $a_i$ times.

Does anybody have a reference for this?

share|cite|improve this question
up vote 3 down vote accepted

The numbers you refer to are known as Kostka numbers. They are discussed in standard references like Fulton's Young Tableaux and Stanley's Enumerative Combinatorics. The weights of a tableaux are often referred to as their content, as well.

share|cite|improve this answer
What is the number for the partition $2n=(2,2,2,...,2)$ and $a_i=2$ for all $i$ ? – Ram Feb 12 '15 at 6:11
sorry, just ignore the last comment. I need the number for the partition $2n=(n,n)$ and $a_i=2$ for all $i=1,2, \cdots ,n$. – Ram Feb 12 '15 at 6:23

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.