手册

数学

Discovery

Andrius Kulikauskas

  • ms@ms.lt
  • +370 607 27 665
  • My work is in the Public Domain for all to share freely.

Lietuvių kalba

Introduction E9F5FC

Understandable FFFFFF

Questions FFFFC0

Notes EEEEEE

Software


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.

BinomialTheoremYoungDiagrams


Naujausi pakeitimai


Puslapis paskutinį kartą pakeistas 2018 rugsėjo 30 d., 19:05
Tweet