0
$\begingroup$

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 the irreducible representation of $S_n$ associated with Young tableau $(\lambda_1,\dots,\lambda_k)$ where $n=\sum \lambda_i$. What can be said about dimension of $\rho$? I am specifically interested in the case where we have two rows (i.e. $k=2$) and the case where $\lambda_i =1$ for $i\geq 3$.

$\endgroup$
5
  • 2
    $\begingroup$ This is not a research level question. You should use MSE for questions like that. $\endgroup$ Dec 6, 2017 at 12:44
  • 5
    $\begingroup$ @VladimirDotsenko we all have to start somewhere, and this strikes me as a question that a researcher in Area One may encounter that is basic/easy for a researcher in Area Two $\endgroup$
    – Yemon Choi
    Dec 6, 2017 at 13:49
  • 2
    $\begingroup$ @YemonChoi I think that a topic that is discussed in nearly every (non-advanced) course on representation theory is clearly not a research level question. Frankly, I am puzzled why the OP did not bother to open a representation theory textbook first. $\endgroup$ Dec 6, 2017 at 15:56
  • 3
    $\begingroup$ @VladimirDotsenko Because when you're not in the field, you don't know what is easy. $\endgroup$ Dec 6, 2017 at 19:21
  • 5
    $\begingroup$ Actually, it is rather bizarre that the OP knew that there exists an irreducible representation associated with a Young Tableau, and however he did not know the hook length formula. Usually, the two things go (almost) together, at least in the literature I'm familiar with. $\endgroup$ Dec 6, 2017 at 19:30

1 Answer 1

8
$\begingroup$

This is a classical application of Frobenius formula and Vandermonde determinant. We have $$\dim V_{\lambda}=\frac{n!}{l_1! \cdots l_k!} \prod_{i<j}(l_i-l_j),$$ where $l_i=\lambda_i+k-i$. See Section 4.1 of

W. Fulton, J. Harris: Representation Theory (a first course), GTM 129 (1991).

$\endgroup$
2

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.