8
$\begingroup$

Let $V$ be a finite-dimensional, complex vector space and set $\newcommand{\Gl}{\mathrm{Gl}}G:=\Gl(V)\times\Gl(V)$. Let $E:=\mathrm{End}(V)$ and consider its coordinate ring $\mathbb C[E]$, the space of all polynomial functions on $E$. It is well-known (see 9.7 in Claudio Procesi's book on Lie Groups) that as a $G$-module, $\mathbb C[E]$ decomposes as $$\begin{align*} \mathbb C[E]_d &= \bigoplus_{\lambda\mathrel\vdash d} \mathbb S_\lambda(V^\ast)\otimes\mathbb S_\lambda(V) \end{align*}$$ where $\mathbb S_\lambda$ denotes the Schur functor. Now, simply by choosing a basis and restricting to permutation matrices, we have an action of $S:=S_n\times S_n$ on $E$ and therefore, also on $\mathbb C[E]$. Hence, there must be some decomposition $$\begin{align*} \mathbb C[E]_d &= \bigoplus_{\lambda,\mu \mathrel\vdash n} (\mathbb V_\lambda\otimes \mathbb V_\mu)^{\oplus N_d(\lambda,\mu)} \end{align*}$$ where $\mathbb V_\lambda$ is the Specht module and $N_d(\lambda,\mu)\in\mathbb N$ are certain multiplicities.

My question is: What, if anything, is known about the $N_d(\lambda,\mu)$?

$\endgroup$

1 Answer 1

2
$\begingroup$

You can give a formula for these numbers in terms of plethysm and internal product and inner product.

The starting point is Exercise 7.74 of Enumerative Combinatorics II by Richard Stanley which is a formula for the Schur functors of the defining representation of the symmetric group in terms of plethysm and inner product.

$\endgroup$
2
  • $\begingroup$ It is a start, indeed, but I don't really know how to compute $\langle s_\lambda, s_\mu[h]\rangle$ either. In fact, I haven't even fully understood Stanley's definition of plethysm, but maybe I have a better chance after reading the Appendix from the start. $\endgroup$ Mar 1, 2013 at 8:51
  • 1
    $\begingroup$ It takes a while to get used to plethysm and it is notoriously difficult to compute. $\endgroup$ Mar 1, 2013 at 9:44

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.