I have now added statement of and references for the actual/standard form of the hook-content formula:

$\left\vert ssYTableaux_\lambda(N)\right\vert \;=\; s_{\lambda} \big( x_1 \!=\! 1, \cdots, x_N \!=\! 1 \big) \;\; = \;\; \underset{ (i,j) }{\prod} \frac{ N + content(i,j) }{ \ell hook_\lambda(i,j) } \,.$I am indebted to Abdelmalek Abdesselam for hints. (The combinatorics literature is a bit weird about this.)

]]>We should have something on the relationship between hook lengths and rep dimensions. So for $Sym(n)$, the dimension of the rep corresponding to YT $\lambda$ is

$\frac{n!}{\prod_{u: \lambda} h_{\lambda(u)}}.$From a nice efficient set of notes here:

- Yufei Zhao,
*Young Tableaux and the Representationsof the Symmetric Group*, (pdf)

adding the hyphen to the title, since apparently the name does not refer to “content of hooks” but to “hooks and content” of boxes. I have added a line on this point to the entry,

]]>I have added the statement, with all its ingredients.

Not fully proof-read yet, but need to urgently do something else for the moment.

]]>starting something

]]>