Plethysm and lattice point counting
Representation Theory
2015-08-13 v3 Combinatorics
Abstract
We apply lattice point counting methods to compute the multiplicities in the plethysm of . 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 for the multiplicity of in .
Cite
@article{arxiv.1408.5708,
title = {Plethysm and lattice point counting},
author = {Thomas Kahle and Mateusz Michalek},
journal= {arXiv preprint arXiv:1408.5708},
year = {2015}
}
Comments
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 JFoCM