Questions tagged [young-tableaux]

For standard Young tableaux, semistandard Young tableaux, and other related two-dimensional arrays of numbers like plane partitions. Including their combinatorial theory and their application in representation theory and algebraic geometry.

Filter by
Sorted by
Tagged with
21 votes
2 answers
2k views

Has Reifegerste's Theorem on RSK and Knuth relations received a slick proof by now?

For the notations I am using, I refer to the Appendix at the end of this post. Here is what, for the sake of this post, I consider to be Reifegerste's theorem: Theorem 1. Let $n\in\mathbb N$ and $i\...
darij grinberg's user avatar
21 votes
2 answers
1k views

3D generalizations of permutations, RSK correspondence, contingency tables, etc.

I want to gather facts and questions related to 3D generalizations of permutations, RSK correspondence, contingency tables, etc. One reason I am interested in this is because it is potentially related ...
Jonah Blasiak's user avatar
9 votes
1 answer
900 views

A basic question about Young symmetrizers

This is probably elementary for experts on the representation theory of the symmetric group, but I did not find the answers I need by a cursory look at the usual textbooks (they could be there, but I ...
Abdelmalek Abdesselam's user avatar
51 votes
2 answers
18k views

Is there winning strategy in Tetris ? What if Young diagrams are falling?

Question 1 Is there a winning strategy (algorithm to play infinitely) in Tetris, or is there a sequence of bricks which is impossible to pack without holes? Consider generalized Tetris with Young ...
Alexander Chervov's user avatar
23 votes
1 answer
1k views

On an asymptotic formula of Keating and Snaith involving the Riemann zeta function

Keating and Snaith have a famous conjecture on the asymptotics of the integral $\int_0^T |\zeta(\frac 12+it)|^{2k}\, dt$, where $\zeta$ denotes the Riemann zeta function. See page 510 of the book ...
Richard Stanley's user avatar
13 votes
1 answer
674 views

Most computationally efficient Littlewood-Richardson rule

There are many, many different versions of the Littlewood-Richardson rule: the original characterization via Yamanouchi words, Remmel's version, a description via the Poirier-Reutenauer bialgebra, the ...
Zach H's user avatar
  • 1,899
12 votes
0 answers
318 views

Bijective proof of an identity involving number of standard Young tableaux and semistandard tableaux

Question. Can you find a bijective proof of the identity $$ \operatorname{dim}(S^{\lambda} \mathbb{C}^m)\ \operatorname{dim}(S^{\lambda'} \mathbb{C}^n) \ f^{n^m} = \dim \Lambda^p (\mathbb{C}^m \...
Piotr Śniady's user avatar
9 votes
3 answers
709 views

Random RSK and Plancherel Measure

Let $(X_1,X_2,\ldots)$ be a sequence of i.i.d. random variables. It is known that if these random variables are distributed uniformly on the unit interval, then applying the RSK algorithm to this ...
Alex R.'s user avatar
  • 4,902
9 votes
3 answers
1k views

bijection between number of partitions of 2n satisfying certain conditions with number of partitions of n

Suppose $\lambda = (\lambda_1,\lambda_2,.....,\lambda_k)$ is a partition of $2n$ where $n \in \mathbb N$ satisfying the following conditions: (1) $\lambda_{k} = 1$. (2) $\lambda_{i} - \lambda_{i+1} \...
Rekha Biswal's user avatar
6 votes
1 answer
570 views

Does there exist a sequence of groups whose representation theory is described by plane partitions?

More precisely, does there exist a sequence $G_1 < G_2 < \cdots$ of finite groups such that the irreducible representations of $G_n$ are parameterized by the plane partitions of total size $n$?
Qiaochu Yuan's user avatar
5 votes
0 answers
322 views

Determinantal formula for plane partitions of shifted shape

For $\lambda = (\lambda_1,\ldots,\lambda_{\ell})$ a partition, a (weak) plane partition of shape $\lambda$ is a filling of the Young diagram of $\lambda$ with nonnegative integers such that entries ...
Sam Hopkins's user avatar
  • 22.7k
5 votes
1 answer
403 views

Iterated derivative and rectangular standard Young tableaux

We first make a few definitions, seemingly out of the blue (they are introduced/defined in this paper). Let $F^0_{a}(z) = (1-z)^{-1}$ and define recursively $$ F^{k+1}_{a}(z) = z^{a-1} \frac{d^a}{dz^...
Per Alexandersson's user avatar
1 vote
0 answers
109 views

Hook-content polynomial 2

Recently I have proven the following identity \begin{align} \sum_{\lambda\in \text{different hook of size d}} \frac{1}{d!} (-1)^{ht(\lambda)-1} \, \dim \lambda \, \prod_{\Box \in \lambda} \frac{1}{1-...
GGT's user avatar
  • 685