Questions tagged [young-tableaux]
For questions on the Young tableau, a combinatorial object useful in representation theory and Schubert calculus. It provides a convenient way to describe the group representations of the symmetric and general linear groups and to study their properties.
197
questions
4
votes
1
answer
56
views
Exercise 8.6 of Algebraic Combinatorics by Stanley
Problem 6 in Chapter 8 of Algebraic Combinatorics by Stanley: Show that the total number of standard Young tableaux (SYT) with $n$ entries and at most two rows is ${n \choose \lfloor n/2 \rfloor}$. ...
0
votes
0
answers
5
views
Conjugate of a Gel'fand pattern
Background:
A Gel'fand pattern is a set of numbers
$$
\left[\begin{array}{}
\lambda_{1,n} & & \lambda_{2,n} & & & \dots & & & \lambda_{n-1,n}...
- 248
0
votes
0
answers
45
views
How to compute the character by "removing the hooks"?
I am reading a paper by McKay in 1971, the name of the paper is Irreducible Representations of Odd Degree. There is a theorem said: ${m}_{2}({S}_{n})=2^r$, where $n=\sum 2^{k_i}$, ${k}_{1}>{k}_{2}&...
- 1
2
votes
0
answers
77
views
Restriction of induced representation over a Young subgroup and Littlewood-Richardson coefficients
I'm inexperienced in the representation theory of the symmetric group, so please correct my possible mistakes. Fix $m\leq n$, $G:=S_n$ and $H:=S_m\times S_{n-m}$ as a Young subgroup of $G$. Let $V^{\...
- 4,886
0
votes
1
answer
71
views
An example of application of the Littlewood–Richardson rule [closed]
I am computing the Littlewood–Richardson coefficients (https://en.wikipedia.org/wiki/Littlewood%E2%80%93Richardson_rule) of the product $s_{[2,2]}s_{[1,1]}$ both by hand and a software tool (https://...
0
votes
0
answers
38
views
Does this partial order on semistandard Young tableaux have a name?
Given a semistandard Young tableau $T$ of shape $\lambda$, let $c_i(T)$ is the number of $i$'s that appear in $T$. We can define a partial order on the set of all semistandard Young tableau of some ...
- 437
1
vote
0
answers
27
views
I want to count the multiplicity of specific peak sets occurring in a standard shifted tableau with some restrictions. Possibly using path counting?
Ok first some definitions:
Let a shifted diagram of some strict partition $\lambda$ be a Young tableau whose $i^{th}$ row is shifted $i-1$ spaces to the right, (I use french notation, and start ...
- 31
3
votes
0
answers
82
views
Schur functors = Weyl functors in characteristic zero?
In the paper `Schur functors and Schur complexes' by Akin et al., the notion of a Schur functor had been defined for the first time over an arbitrary commutative ring $R$.
To recall the definition (I ...
- 642
0
votes
0
answers
176
views
Dimension of irreducible totally-symmetric tensor product of two su(n) representations
Consider the irreducible representation of $\mathfrak{su}$(n) given by the Young tableu
The dimension of the representation is easily obtained by the usual rules, and it is $d=n(n-1)/2$. One can also ...
- 133
3
votes
0
answers
221
views
Inequality regarding kostka numbers in representation theory
Before I post my question, let me set up some notation.
Notation. For $k\geq 1$, let $\lambda \vdash k$ be a partition of $[k]$. Let $C(k,m)$ be the set of all partitions $\lambda \vdash k$ of size $m$...
- 31
1
vote
0
answers
41
views
Tableau which corresponds to alternating square representation
Recall that $S_5$ acts on $\mathbb C^5$ by permuting its coordinates and that $\mathbb C^5$ decomposes as $V\oplus W$ where $W$ is the trivial representation and $V$ has dimension $4$. Show that the ...
- 9,534
1
vote
1
answer
138
views
The irreducible representation of $S_n$ corresponding to the partition $n = (n − 1) + 1$
Let a finite group $G$ act doubly transitively on a finite set $X$, i.e., given $x,y,z,w\in X$ such that $x\neq y$ and $z\neq w$, there is a $g\in G$ such that $g.x=z$ and $g.y=w$. So, we can write
$$\...
- 9,534
1
vote
0
answers
162
views
Idempotency of the Young symmetrizer
Let $t$ be a (not necessarily standard) tableau of shape $\lambda \vdash n$ consisting of the numbers $1, ..., n$, each used exactly once.
Notation:
(i) $\mathfrak{S}_{n}$ is the symmetric group on $n$...
- 245
1
vote
1
answer
121
views
Permuting the rows in ascending order first and then the columns of any Young tableau gives a standard Young tableau
Show that if you take any Young tableau and permute the rows in ascending order first and then the columns in ascending order (or columns first and then row), then you get a standard Young tableau.
I ...
- 9,534
2
votes
0
answers
78
views
Weighted sum over integer partitions involving hook lengths
I am trying to compute the following quantity:
$$ g_n(x) = \sum_{\lambda \vdash n} \prod_{h \in \mathcal{H}(\lambda)} \frac{1}{h^2} \exp\left[x\sum_i \binom{\lambda_i}{2} - \binom{\lambda_i'}{2}\right]...
- 484