Skip to main content

All Questions

2 votes
0 answers
260 views

Counting Semistandard Young Tableaux For Triangular Shapes?

If $k \leq n$ I denote the Young diagram with shape $(n,n-1,n-2,\ldots,1)$ by $\lambda^{n,n-1,\ldots,1}$. I write $f^{\lambda_n^{n,n-1,\ldots,1}}$ to count the number of semistandard Young tableaux ...
Anthony's user avatar
  • 3,788
0 votes
1 answer
505 views

Counting the number of semistandard Young Tableaux with maximum entry $n.$ Reference/Formula request

Question: If $k \leq n$ let $\lambda_k$ be a Young diagram with square $k \times k$ shape. I write $\#_{\lambda_{k}^n}$ to count the number of semistandard Young tableaux with shape $\lambda_k$ and ...
Anthony's user avatar
  • 3,788
0 votes
0 answers
96 views

Part sum of a partition of a positive integer $n$

Let $\lambda = (\lambda_1,\lambda_2,\ldots,\lambda_p)$ be a partition of a positive integer $n$. We call $\lambda_i$ a part of $\lambda$. I am interested in the sum of arbitrary parts of $\lambda$. ...
bing's user avatar
  • 1,160