References:
https://blog.csdn.net/acdreamers/article/details/14549077
IOI2019 national reserve thesis: "Application of the Young tableau in informatics contest of" Yuan Ark
definition:
Yang map:
A matrix of n * m.
There are some elements on the lattice, and some do not.
If there is no element of a grid, it's also not right and top elements.
Probably a jagged things:
Yang table:
The position of each element is a number, and a is arranged.
The number of increments for each row from left to right, top to bottom of each column number is incremented:
Young tableau number consisting of 1-n:
\ [F [. 1] = F \\. 1 [2] = 2 \\ F [n-] = F [n--. 1] + (. 1-n-) F [n- -2] (n> 2) \
] not demonstrated.
Theorem hook
Yang knows a map, it is the number of standard Young tableaux:
\ ((The total number of grid)! / \ Prod (the top number in each grid lattice grid number +1 + right side)! \)
Not proved × 2.