We apply lattice point counting methods to compute the multiplicities in the
plethysm of GL(n). Our approach gives insight into the asymptotic growth of
the plethysm and makes the problem amenable to computer algebra. We prove an
old conjecture of Howe on the leading term of plethysm. For any partition μ
of 3,4, or 5 we obtain an explicit formula in λ and k for the
multiplicity of Sλ in Sμ(Sk).Comment: 25 pages including appendix, 1 figure, computational results and code
available at http://thomas-kahle.de/plethysm.html, v2: various improvements,
v3: final version appeared in JFoC