Say $n \ge 5$. Let $P$ be the $(n-1)$ dimensional permutation module for $S_n$, i.e. the permutation representation on $\{(x_1, \dots, x_n) \in {\bf C}^n: \sum x_i = 0\}$. Prove that:
- $\wedge^2P$ is always a irreducible $S_n$-module;
- $\text{Sym}^2P$ is always isomorphic to the sum of the trivial representation, $P$ and an irreducible $S_n$-module.
Is there a way to do this problem without using something "overpowered" such as Young tableaus?
These questions can be answered with a little bit of character theory. If you can work out the character of $P$, then the character of $\wedge^2 P$ is not so bad. For instance look at the bottom of the second answer of this question. Symmetric and exterior power of representation
Once you can compute the character of the relevant representations, finding their decompositions is not so difficult. If you have questions, we can discuss in the comments.