Plethysm and lattice point counting
arXiv:1408.5708 · doi:10.1007/s10208-015-9275-7
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 .
arXiv comment25 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
References in corpus (8)
- The stability of the Kronecker products of Schur functions
- Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
- Eigenvalue Distributions of Reduced Density Matrices
- Even Partitions in Plethysms
- Secants of minuscule and cominuscule minimal orbits
- Computing Multiplicities of Lie Group Representations
- Perturbation of transportation polytopes
- Cyclic Sieving and Plethysm Coefficients