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.
165
questions
1
vote
0
answers
88
views
Counting certain kinds of Semistandard Young Tableaux
We have a project in which it is natural to count the number of Young Tableau in which part of the weight has been specified. Does anybody know if this idea already appears in the literature?
More ...
- 270
3
votes
1
answer
186
views
Decomposition of tensor powers of the vector representation of $\frak{sl}_n$
Let $V(\pi_1)$ be the usual vector/matrix representation of the Lie algebra $\frak{sl}_n$, for $n > 2$. A basic fact is the tensor product $V(\pi_1) \otimes V(\pi_1)$ decomposes as
$$
V(\pi_1) \...
- 247
3
votes
0
answers
86
views
Generalized Gaussian binomial and symmetric chain decomposition
Background
Let $\mu = (\mu_1, \ldots, \mu_k)$ be a partition, meaning that $\mu_1 \geq \ldots \mu_k \geq 1$. The Young diagram associated to $\mu$ is given by the set $(r,c) \in \mathbb{N} \times \...
- 795
1
vote
1
answer
152
views
hook length formula for plane partitions
The hook length formula give a simple product expression for the number of standard Young tableaux of a given shape $\lambda$, where $\lambda$ is an integer partition, or equivalently, the number of ...
- 528
8
votes
0
answers
192
views
Alternate proof in Fulton–Harris of representation theoretic version of Littlewood–Richardson rule
$\DeclareMathOperator\Ind{Ind}$Let $d = d_1 + d_2$ with $d_1$, $d_2$ positive integers. Let $\lambda$ be a partition of $d_1$ and $\mu$ a partition of $d_2$, so that the Young symmetrizer construction ...
- 219
7
votes
0
answers
417
views
Mistakes in Logan and Shepp's famous paper on Young Tableaux?
In their landmark paper from 1977 named "A Variational Problem for Random Young Tableaux" Logan and Shepp obtained a number of results concerning asymptotic properties of Young Diagrams ...
- 106
3
votes
1
answer
329
views
References for applications of Young diagrams/tableaux to Quantum Mechanics
I am interested in knowing more about applications of Young diagrams and Young tableaux to Quantum Mechanics. A friend of mine suggested as a reference the following book:
Wybourne, B.G.; "...
- 4,255
0
votes
0
answers
153
views
Young tableaux — irreps correspondence for simple complex Lie algebras
$\DeclareMathOperator\GL{GL}\DeclareMathOperator\SL{SL}$I have learned that Young tableaux which were originally
introduced to study the irreducible representations of finite
symmetric groups $S_n$ ...
- 4,994
7
votes
1
answer
153
views
A formula for the generating function of Hoggatt binomials or of some Young tableaux
Let ${\left\langle\matrix {n \cr k}\right\rangle}_r$ denote the $r-$Hoggatt binomials defined by
$${{\left\langle\matrix {n \cr k}\right\rangle}_r=\frac{\langle n \rangle_r!}{\langle k \rangle_r! \...
- 5,440
7
votes
1
answer
220
views
Robinson-Schensted-Knuth (RSK) under restriction
I am curious about the following result concerning the Robinson-Schensted insertion procedure. I can formulate a proof via the Schützenberger evacuation operator, but I have struggled to find such an ...
- 81
2
votes
0
answers
119
views
Counting integer partitions below some Young diagram
Question: Given positive, coprime integers $m<n$, consider the Young diagram $Y$ formed by the lattice points in the Cartesian plane lying below the line from $(0,0)$ to $(m,n)$ and within the ...
- 705
6
votes
0
answers
104
views
Bijection between forests and skew SYT + Cyclic sieving
Consider the two-row skew shape $\lambda_n = (2n+1,n)/(1)$.
The number of standard Young tableaux of this shape is
$\binom{3n}{n}-\binom{3n}{n-2}$ (since one can easily biject this to the set of non-...
- 15.3k
5
votes
1
answer
205
views
On a proof involving Young symmetrizers acting on tensor spaces
I hope this is not too elementary for this site, but I already asked something similar on MSE which has not received any attention whatsoever. I am extremely unfamiliar with the algebraic/...
- 2,097
1
vote
0
answers
122
views
$\mathfrak{sl}_2$-action on Young diagrams
Let $\mathcal{Y}$ be a vector $\mathbb{Q}$-space of all Young diagrams. Denote by $\delta_\lambda$ the Young diagram of the partition $\lambda$ and $c(\square)$ be
the content of the square $\...
- 516
3
votes
0
answers
137
views
The Grassmann twist-map, an associated semi-group action, and RSK
Let me begin by setting some notation: Let $\mathrm{Mat}_{k,n}(\Bbb{R})$ denote the vector space of all $k \times n$
real-valued matrices. Given $g \in \mathrm{Mat}_{k,n}(\Bbb{R})$ and two (ordered) ...
- 1,757
9
votes
0
answers
226
views
Hives for other root systems? [duplicate]
Littlewood-Richardson coefficients $c^\lambda_{\mu\nu}$ have numerous combinatorial interpretations, including the hive model by Knutson and Tao, see here. For other root systems, there are also ...
- 16.1k
4
votes
0
answers
174
views
Relationship between $\mathbb{S}^{\nu}V \otimes \mathbb{S}^{\lambda}(V^{*})$ and $\mathbb{S}^{\nu / \lambda}V$
For partition $\mu$ let $\mathbb{S}^{\mu}V = V^{\otimes \mu} \cdot c_{\mu}$, where $c_{\mu}$ is the Young symmetrizer. I'm trying to prove that $\mathbb{S}^{\nu / \lambda}V$ is the polynomial part of $...
- 49
0
votes
0
answers
82
views
Addition theorem for Schur function in multivariable
Working with the following problem Expansion in Schur function of negative binomial exponent
I need to find the expansion of
$$ s_{\lambda}(x_1 + y , x_2 +y, \ldots, x_n +y)$$
in terms of schur ...
- 675
2
votes
0
answers
101
views
Yamanouchi ribbon tableaux?
Let $s_{\lambda}$ be a Schur function. The set of all such functions are known to be a linear basis of the algebra of symmetric functions.
The Littlewood-Richardson coefficients $c_{\nu\mu}^{\lambda}$ ...
- 795
1
vote
0
answers
127
views
Status of conjecture of Conrey and Gonek, combinatorial meaning
I was looking at the OEIS on the number of square Young Tableaux.
In it Michael Somos referenced a paper of Conrey and Gonek, High Moment's of the Riemann Zeta-Function. Is there an combinatorial ...
- 761
1
vote
0
answers
66
views
Scalars by which symmetrizations of cyclic permutations act on Specht modules
Let $S_n$ be the symmetric group. Pick $a \in 2,\ldots,n$ and denote by $c_a \in \mathbb{C}[S_n]$ the symmetrization of the element $(12\ldots a)$ i.e. $c_a$ is the sum of cycles of type $a$.
Let $\...
- 143
1
vote
1
answer
144
views
Number of paths to a specific vertex in the Young's lattice
Consider the Young's lattice. What is the number of paths starting from the origin (0) to a specific Young diagram?
For instance, the Young diagram corresponding to the integer partition 1+1+1 has 1 ...
- 153
2
votes
1
answer
120
views
Number of branches between two layers of the Young's lattice
In the Young's lattice, the number of branches that connect the $N$'th layer to the $N+1$'th layer has the sequence:
$$
1,2, 4, 7, 12, 19, 30, 45, 67, 97, 139, \cdots
$$
Looking this up on OEIS, leads ...
- 153
12
votes
2
answers
325
views
Lattice structure (wrt dominance order) on the set of Young diagrams appearing in the decompositions given by the Littlewood-Richardson rule
The irreducible decomposition of the tensor product of two irreducible representations of GL(n) is described by the Littlewood-Richardson rule. This same rule also governs the decomposition of the ...
- 431
4
votes
0
answers
122
views
Map between irreducible representations in basis given by Young tableaux
Let $V$ be a $n$-dimensional complex vector space.
Assume we have a $\mathbb C$-linear map $\varphi:\Gamma^{(a_1,\dots,a_n)}V\rightarrow \Gamma^{(b_1,\dots,b_n)}V$ between two irreducible ...
- 1,371
1
vote
0
answers
67
views
LGV scheme: Any situations where the weights shift differently for each path?
In Cylindric partitions, Proposition 1, Gessel and Krattenthaler prove a formula for lattice paths on a cylinder
In our particular problem, we again have paths $((P_{1},k_{1}),...,(P_{r},k_{r}))$ but ...
- 2,840
9
votes
0
answers
464
views
Two majs for standard Young tableaux?
Let $\lambda$ be a partition of $n$, and consider its set of standard Young tableaux (SYTs): bijective fillings of the Young diagram of $\lambda$, written in English notation, with the numbers $1$ ...
- 20.8k
4
votes
2
answers
286
views
LGV scheme for lattice paths that move in non-unit spatial positive steps
In the Lindström–Gessel–Viennot lemma (LGV) applied to the $Z^2$-lattice paths are taken to move in unit spatial-steps in unit time (see here).
What do we mean by "time"? In the language of ...
- 2,840
8
votes
0
answers
256
views
A question related to Young symmetrizers
Let $T$ be an arbitrary Young tableau (i.e., filling of the diagram of an integer partition $\lambda$ of $n$ by the numbers from $1$ to $n$, each appearing once). Let $R(T)$ be the subgroup of ...
- 20.9k
2
votes
0
answers
89
views
The distribution of amajor over standard Young tableaux?
Given a standard Young tableau $T$, $i$ is called an ascent of $T$ if $i+1$ is in a higher row than $i$, and amajor$(T)$ is defined to be the sum of ascents of $T$. For the distribution of the amajor ...
- 115
1
vote
0
answers
91
views
RSK correspondence for sum of two matrices
The celebrated RSK correspondence (see Wikipedia page) assigns to each integer $X$ matrix a pair of Young tableaux $P$ and $Q$. Now suppose that we have three integer matrices $X_1$, $X_2$, and $X_3$, ...
- 121
5
votes
1
answer
607
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 ...
- 20.9k
8
votes
0
answers
180
views
Generalized Young symmetrizers, why not?
For $n$ a positive integer, let $[n]=\{1,2,\ldots,n\}$. Consider two set partitions $\mathcal{A}=\{A_1,\ldots,A_p\}$ and $\mathcal{B}=\{B_1,\ldots,B_q\}$ of the set $[n]$.
We will denote by $G(\...
- 20.9k
7
votes
0
answers
110
views
A question regarding an analog of Young symmetrizer: the product row and column preserving subgroups without sign representation
Consider a rectangular Young diagram $\lambda$ with $n = pq$ boxes, with $p$ rows and $q$ columns. If $C$ is the column preserving subgroup of $\lambda$ and $R$ is the row preserving subgroup, then we ...
- 121
7
votes
1
answer
572
views
Bender-Knuth involutions for symplectic (King) tableaux
First let me recall the combinatorial theory of the characters of $\mathfrak{gl}_m$, a.k.a., Schur polynomials. For a partition $\lambda$, a semistandard Young tableaux of shape $\lambda$ is a filling ...
- 20.8k
3
votes
0
answers
118
views
Consequences of Littlewood-Richardson rule
I am trying to read Deligne's paper 'Categories Tensorielles', and in the first chapter Deligne states some results obtained from the Littlewood-Richardson rule that I do not understand.
He states: '...
- 275
2
votes
0
answers
59
views
Expansion of polytabloids in the standard basis
would like to know the most efficient way to write a polytabloid in terms of standard ones.
I know the Garnir elements, but using them to do calculations is hard. I also read about "quadratic ...
- 795
6
votes
1
answer
441
views
Refined reverse plane partition generating function
I have a simple question about the generating function for reverse plane partitions:
$$\sum_{\pi \in RPP(\lambda)} z^{|\pi|}= \prod_{s \in \lambda} \frac{1}{1-z^{h_{\lambda}(s)}}$$
There's a ...
- 81
8
votes
1
answer
411
views
RSK correspondence
Up to now, what are the difference ways we know to define RSK correspondence? I already know:
By insertion and recording tableau.
Ball construction or Viennot's geometric construction.
Growth diagram ...
- 320
16
votes
3
answers
659
views
Plane partitions with equal margins
A plane partition of $n$ is an table of integers $A=(a_{ij})$ which add up to $n$ and non-increase in rows and columns. For example,
$$A= \begin{matrix} 331 \\
32 \ \ \\
11 \ \
\end{matrix}
$$
is a ...
- 16.1k
3
votes
0
answers
117
views
Tableaux switching
I'm reading the article Tableau Switching: Algorithms and Applications by Benkart, Sottile, and Stroomer. Do you know if there are any articles or books that talk more about the properties of tableau ...
- 320
5
votes
0
answers
301
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 ...
- 20.8k
5
votes
3
answers
284
views
Tensoring irreducible $B$-series representations/ Type B Littlewood-Richardson
When tensoring finite dimensional representations of the Lie algebra ${\frak sl}_n$, we have an explicit algorithm given in terms of Young diagrams. See Section 4 of this paper.
Do there exist ...
- 633
2
votes
0
answers
104
views
Restricted Cauchy identity
Is there some reference for sums like:
$$\sum_{\nu \subset \mathrm{[1,n] x[1, m]}}s_{\nu}(x)s_{\nu}(y)t^{|\nu|}$$
$$\sum_{\nu \subset \mathrm{[1,n] x[1, m]}}s_{\nu}(x)s_{\nu}(y)\cdot|\nu|$$
(summation ...
- 625
3
votes
0
answers
229
views
Constructing a centrally primitive idempotent in the group algebra of the symmetric group
Consider the group algebra of the symmetric group $ \mathbb{C} S_k$.
Given some Young tableau $T$ of shape $\lambda$, let $a_{\lambda,T}$ and $b_{\lambda,T}$ be the row symmetrizer and column ...
- 219
5
votes
1
answer
392
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^...
- 15.3k
4
votes
1
answer
194
views
Decomposing tensor powers of the fundamental representation of exceptional Lie algebras
For the $A$-series, tensor powers of the fundamental representation of $\frak{sl}_n$ decompose into irreducibles according to a certain Young diagram/ partition formula. This inspires, for example, ...
- 805
10
votes
1
answer
309
views
About $K$-rectification of increasing tableaux
Let $T$ be a standard Young tableaux on $[n]$. Denote the RSK algorithm $\text{RSK}(w)=(P(T),Q(T))$ for $w\in\mathfrak{S}_n$, where $P(T)$ is the Schencted insertion tableaux.
For $1\leq i\leq j\leq n$...
4
votes
0
answers
105
views
Intersection of components in Springer fibre of type A
From the standard results on Springer fibers of type A, we know that given a Springer fiber, say $\mathcal{B}_\lambda,$ its irreducible components are all equidimensional and parametrized by standard ...
- 1,537
13
votes
1
answer
534
views
Coincidences between average Catalan tableaux
There are Catalan number $C_n$ of standard Young tableaux of shape $(n,n)$, which we view as $2\times n$ matrices. Denote by $P_n$ the average of these matrices:
$$
P_n \, := \, \frac{1}{C_n} \, \...
- 16.1k