Iš Gvildenu svetainės

Book: BinomialTheoremYoungDiagrams

See: Binomial theorem

{$\binom{n}{i}$} counts the number of Young diagrams that fit within a rectangle with sides i and n-i.

The fact that the rows of the Young diagram are organized in increasing order means that a single square determines whether the Young diagram is built from those which do not use that column or those that do.

Parsiųstas iš http://www.ms.lt/sodas/Book/BinomialTheoremYoungDiagrams
Puslapis paskutinį kartą pakeistas 2018 rugsėjo 30 d., 19:05