TL;DR
This paper uses lattice point counting techniques to analyze plethysm multiplicities in $GL(n)$, providing explicit formulas, asymptotic insights, and proving a longstanding conjecture by Howe.
Contribution
It introduces a novel lattice point counting approach to plethysm, enabling explicit formulas and asymptotic analysis, and proves Howe's conjecture on the leading term.
Findings
Proved Howe's conjecture on the leading term of plethysm.
Derived explicit formulas for partitions of 3, 4, and 5.
Provided asymptotic growth insights for plethysm multiplicities.
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Plethysm and Lattice Point Counting· youtube
