Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [young-tableaux]

The tag has no usage guidance.

1
vote
0answers
43 views

To find $\dim(D^{\mu})=\dim\frac{S^{\mu}}{S^{\mu}\cap S^{\mu\perp}}$

Let $S_6$ be the symmetric group of degree $6$ and $F$ be any finite field of characteristic $2.$ Then $2$-regular partition of $6$ are $(5,1)$, $(4,2)$ and $(3,2,1)$ . I have to find $$\dim(D^{\mu})=\...
5
votes
1answer
145 views

Schutzenberger's evacuation and $\mu$-coefficient of Kazhdan–Lusztig polynomials

$\def\SYT{\mathrm{SYT}}\def\RSK{\mathrm{RSK}}\DeclareMathOperator\evac{evac}$Let $\mathfrak{S}_n$ be the symmetric group, $\SYT_n$ be the set of standard young tableaux of size $n$. For $u\in \...
4
votes
1answer
206 views

Bijection between noncrossing matchings on $2b$ points and Standard Young Tableaux of size $2 \times b$

I'm currently reading a review article called Dynamical Algebraic Combinatorics: Promotion, Rowmotion, and Resonance by Jessica Striker. In this article, Striker writes that there is a ''nice'' ...
3
votes
1answer
175 views

Nekrasov Partition Function: $F^{inst}(\epsilon_1,\epsilon_2,\mathbf{a},\mathbf{q})$ analytic at $\epsilon_1 = \epsilon_2 = 0$?

Nakajima & Yoshioka [1] showed that \begin{equation} F^{inst}(\epsilon_1,\epsilon_2,\mathbf{a},\mathbf{q}) = \sum_{n = 1}^\infty \mathbf{q}^nF^{inst}_n(\epsilon_1,\epsilon_2,\mathbf{a}) := \...
24
votes
3answers
796 views

Is the Ford-Fulkerson algorithm a tropical rational function?

The Ford-Fulkerson algorithm Let me recall the standard scenario of flow optimization (for integer flows at least): Let $\mathbb{N} = \left\{0,1,2,\ldots\right\}$. Consider a digraph $D$ with vertex ...
1
vote
0answers
55 views

A dimension formula for generalised symmetric powers of the natural module

I need a reference for the following well-known statement - does anyone know one? Let $\mu$ a partition of $n$ into at most $d$ parts. We let $${\rm Sym}^\mu(\Bbbk^d)={\rm Sym}^{\mu_1}(\Bbbk^d) \...
5
votes
0answers
151 views

Tabloid Construction of Permutation Representation of Hyperoctahedral Group

For a partition $\lambda \vdash n$, the permutation representation $M^{\lambda}$ of the symmetric group can be constructed in two ways. First, it may be written as the induced representation $M^{\...
3
votes
0answers
128 views

Orthogonal basis for decomposition of induced representation of derangements

Background Let $V_n$ be the $\mathbb{C}$-module spanned by the set of derangements (permutations with no fixed points) inside the group ring of $S_n$. We make $V_n$ into a $\mathbb{C}S_n$-module ...
0
votes
1answer
208 views

Dimension of irreducible representation associated to a Young tableau

This might be a classic question, but since I am new to representation theory of the symmetric group, I am asking it here. Suppose that $\lambda_1 \geq \lambda_2 \geq \dots \lambda_k$ and $\rho$ be ...
6
votes
0answers
92 views

Natural maps between Schur functors: understanding the image

Let $V$ be a finite dimensional representation of symmetric group $\mathbb{S}_n.$ Consider a natural map $$\pi \colon \Lambda^2 V \otimes \Lambda^2 V \longrightarrow \Lambda^4 V.$$ Let $[\Lambda^2 V]...
5
votes
0answers
156 views

Multidimensional hook length formula

A well-known hook length formula states that the number of ways to arrange the elements of $[n]$ in a Young tableau with $n$ cells so that all columns and rows are increasing is $\frac{n!}{\prod_c h(c)...
5
votes
1answer
163 views

Height growth for randomly falling Tetris like blocks ? What if Young diagrams are falling down?

Question: How the maximal height grows for random Tetris like blocks falling down ? Numeric simulation (see below) shows leading term is linear with some constant depending on shapes of blocks ...
50
votes
2answers
16k 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 ...
4
votes
0answers
555 views

Categorifying the Cauchy kernel as a filtration of $\operatorname*{Sym}\left( F\otimes G\right) $ over any commutative ring

Question 1 (short version). Let $R$ be a commutative ring with unity. Let $F$ and $G$ be two $R$-modules. Let $n\in\mathbb{N}$. Is it true that the $n$-th symmetric power $\operatorname*{Sym}\...
7
votes
0answers
145 views

“Non standard” formulas for eigenspaces in $V_\rho$

In the context of the Simple Lie Algebras Representations, let $\rho$ be half-the-sum of the positive roots and let $V_\rho$ be the irreducible representation of highest weight $\rho$. Let$\mu$ be a ...
1
vote
0answers
87 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-...
3
votes
1answer
215 views

Induced representation of a Young subgroup

This might be a classic question, but since I am new to representation theory of the symmetric group, I am asking it here. Suppose that $n=k+l+r$ where $k\geq l\geq r\geq 0$. Let $G$ be the symmetric ...
12
votes
0answers
199 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 \...
8
votes
0answers
144 views

Littlewood-Richardson sequences and Littlewood-Richardson coefficients

I'm looking for a proof or a reference for the following statement, I give the definitions below: There exists a Littlewood-Richardson sequence of type $(\alpha, \beta, \lambda)$ if and only if $...
4
votes
2answers
96 views

Proportion of partitions in a rectangle

Let $ k, n, r \geqslant 1 $ be integers. Let $ \lambda $ be a partition of $r$, what we denote by $ \lambda \vdash r $. I would like a lower and an upper bound for the following quantity, for all $ ...
7
votes
2answers
183 views

What can be said of a $6$-core Young diagram whose $2$-and $3$-cores are empty

Let $\lambda$ be a partition. Suppose that $\lambda$ is both $2$- and $3$-decomposable, in the sense that $\lambda$ admits a total decomposition by both $2$-rim hooks (aka dominos) and $3$-rim hooks. ...
3
votes
1answer
208 views

Young Symmetrizer and Exterior Products, such as $S_{(2,1)}V = Ker(\Lambda^2V \otimes V \to \Lambda^3V )$

Background: Young symmetrizer $c_\lambda$ gives an explicit description of Schur module $S_\lambda V$, which is also the kernel of maps between exterior products (as in Fulton & Harris). Example:...
6
votes
2answers
207 views

Correspondence between $SBT (n)$ and $W(B_n)$

Let $W(B_n)$ be a Weyl group of type $B_n$ and $SBT (n)$ the set of standard bitableaux of size $n$. Similar to Robinson-Schensted correspondences, I know that there exists a map $W(B_n) \to SBT (n) \...
4
votes
0answers
299 views

Identities satisfied by the image of the Young symmetrizer

Consider a partition $\lambda=(r_1,\ldots,r_k)$ of an integer $n$ and the corresponding Young diagram with rows of length $r_1,\ldots,r_k$ (hence ordered in non-increasing order). Counting the column ...
5
votes
1answer
102 views

Counting the orbits of a set of tabloids under the action of a Young subgroup

Let $\lambda = (\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k)$ and $\mu = (\mu_1 \geq \mu_2 \geq \cdots \geq \mu_\ell)$ be partitions of a positive integer $n$. As in Fulton's book on Young ...
19
votes
1answer
565 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 ...
4
votes
1answer
223 views

Does flipping Young diagrams has anything to do with Fourier?

Here's a chaser to this question. Recall the proof that the number of partition of an integer $n$ into at most $k$ addends is the same as the number of partition of an integer $n$ into integers no ...
25
votes
1answer
767 views

Inequality for hook numbers in Young diagrams

Consider a Young diagram $\lambda = (\lambda_1,\ldots,\lambda_\ell)$. For a square $(i,j) \in \lambda$, define hook numbers $h_{ij} = \lambda_i + \lambda_j' -i - j +1$ and complementary hook numbers $...
4
votes
0answers
172 views

Characterizing the RSK corespondance

The Robinson-Schensted-Knuth correspondence is an algorithm which takes as input a word $w$ on the alphabet $\{1,\dots,n\}$ of length $k$ and returns a pair of a tableau $P(w)$ and a standard tableau $...
6
votes
2answers
251 views

“Diagonalizing” Littlewood-Richardson coefficients

Let's consider the Littlewood-Richardson coefficients $c^{\lambda}_{\mu \nu}$ so that \begin{equation} V_\mu \otimes V_\nu = \bigoplus_\lambda V_\lambda^{\oplus c^{\lambda}_{\mu \nu}} \end{equation} ...
4
votes
0answers
211 views

The properties of Pos

Given $n\in\mathbb{N}$, and $f:\mathbb{N}^*\rightarrow \mathbb{N}$, let define $Pos$ as: $$Pos(f)(n)= |\{x \leq n, f(x)=f(n)\}|$$ When given $n\in\mathbb{N}$, this function gives the 'position' of $...
3
votes
1answer
222 views

Schubert varieties and Young diagrams

In his book Young Tableaux, Fulton asserts, in Exercise 9.4.18 on p. 152, that the Schubert variety $\Omega_{\lambda}$ is defined by the conditions $\text{dim}(V \cap F_{n+i- \lambda_{i}}) \geq i$ for ...
11
votes
2answers
435 views

Tableaux with limited rows and complementary skew shapes

Given a partition $\mu=(\mu_1,\mu_2...,\mu_d)$, define $\bar\mu=(\mu_1-\mu_d,\mu_1-\mu_{d-1},...,\mu_1-\mu_2,0)$, the complementary shape in the $d\times \mu_1$ rectangle. Then the number of skew ...
4
votes
0answers
185 views

Confusion with proof of Pieri's Formula

In Manivel's Symmetric Functions, Schubert Polynomials, and Degeneracy Loci, I am confused with some parts of his proof of Pieri's Formula. It is given as Pieri's Formula $3.2.8$ (p. $109$): If $\...
0
votes
0answers
60 views

The rectification of the transpose of a skew tableau?

Suppose the rectification of a skew tableau is a standard tableau, I want to know if the rectification of the transpose of the skew tableau equals to the transpose of the rectification of the skew ...
0
votes
0answers
52 views

Conceptual question about partitions in a given rectangular grid

Suppose we have a Young diagram $\lambda$ inside an $r \times n$ rectangular grid, i.e. $\lambda \subset [r] \times [n]$. If I were to add just one more box to $\lambda$, obtaining a new partition (...
18
votes
3answers
774 views

Is there a short proof that the Kostka number $K_{\lambda \mu}$ is non-zero whenever $\lambda$ dominates $\mu$?

This is maybe a little basic for MathOverflow, but I'm hoping it will get some interesting answers. Let $\unrhd$ be the dominance order on partitions of $n \in \mathbb{N}$. For partitions $\lambda$ ...
0
votes
1answer
192 views

Reference Request: Irreducibles of the regular representation of the permutation group is absolutely irreducible

I am writing a paper(physics) where I am using the fact that the irreducible's of the regular representations of the permutation group are absolutely irreducible in the following sense. If $V$ is an ...
3
votes
0answers
126 views

Partial orders on tabloids

Let $n \in \mathbb{N}$ and let $\lambda \vdash n$, a partition of $n$. By a $\lambda$-tabloid I mean a row-tabloid of shape $\lambda$. There is a well-known order on the set of $\lambda$-tabloids, ...
5
votes
1answer
177 views

Relations among Young symmetrizers of non-standard tableaux

For any Young tableau, one can form the Young symmetrizer. I'm naturally interested in young symmetrizers coming from standard tableaux, but I'm forced to look at Young symmetrizers of non-standard ...
8
votes
1answer
258 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 ...
1
vote
2answers
190 views

Measures on Young tableaux

I have seen that on the set of Young tableau the Plancherel measure was quite natural to define. I was wondering if other measures were also studied. In particular, a simple exemple which comes to my ...
1
vote
0answers
152 views

Character sums over a fixed subset of skew tableaux

Let $f(\lambda)$ count the number standard young tableaux of shape $\lambda\vdash n$ and $\lambda=(\lambda_1,\cdots,\lambda_r)$. Let $\mu \vdash k$ be a partition for $k<n$. It is a consequence of ...
12
votes
1answer
408 views

No limit shape for random Young diagrams under z-measure?

In their paper Random partitions and the Gamma kernel (Advances in Mathematics 194 (2005) 141–202), Borodin and Olshanski state that: An important difference between the Plancherel measures and the ...
5
votes
0answers
65 views

Uniform generation of Symmetric Plane Partitons

In the conclusion of An Involution Principle-Free Proof of Stanley's Hook-Content Formula Krattenthaler notes that the techniques of the paper might be useful for finding bijective proofs of the ...
4
votes
0answers
148 views

Young Tableau Box Correlations

Let $T$ be a uniformly random Standard Young Tableau (SYT) of shape $\lambda=(\lambda_1,\cdots,\lambda_k)$ with $|\lambda|=n$. Let $T_{ij}$ denote the value in box $(i,j)$. I'm interested in what can ...
5
votes
1answer
189 views

A vector version of the Segre embedding: what is the kernel of the ring map?

TL;DR version. Given a commutative ring $\mathbf{k}$ and $n+m$ "generic" vectors $\mathbf{x}_1, \mathbf{x}_2, \ldots, \mathbf{x}_n, \mathbf{y}_1, \mathbf{y}_2, \ldots, \mathbf{y}_m$ in $\mathbf{k}^k$ ...
7
votes
1answer
314 views

Is there any good survey on the hook length formula and related topics?

I am recently doing some research related to the hook length formula. The hook formula counts the number of Young tableaux of certain type. I find there are plenty of research already been done and ...
24
votes
0answers
744 views

Nekrasov-Okounkov hook length formula

I am now reading the paper An explicit expansion formula for the powers of the Euler Product in terms of partition hook lengths by Guo-Niu Han. The author rediscovered what he calls the Nekrasov-...
8
votes
0answers
325 views

What's the analogue of a Young symmetrizer in the Brauer algebra?

According to Schur--Weyl duality, the centralizer of $\mathrm{GL}(V)$ acting diagonally on $V^{\otimes N}$ is the group algebra of the symmetric group $\mathbb S_N$. An equivalent formulation is the ...