Plethysm and Lattice Point Counting

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

KAHLE, Thomas, Mateusz MICHALEK, 2016. Plethysm and Lattice Point Counting. In: Foundations of Computational Mathematics. Springer. 16(5), pp. 1241-1261. ISSN 1615-3375. eISSN 1615-3383. Available under: doi: 10.1007/s10208-015-9275-7

@article{Kahle2016Pleth-52456, title={Plethysm and Lattice Point Counting}, year={2016}, doi={10.1007/s10208-015-9275-7}, number={5}, volume={16}, issn={1615-3375}, journal={Foundations of Computational Mathematics}, pages={1241--1261}, author={Kahle, Thomas and Michalek, Mateusz} }

eng 2021-01-15T09:45:18Z Michalek, Mateusz Kahle, Thomas 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<sup>λ</sup> in S<sup>μ</sup>(S<sup>k</sup>). Plethysm and Lattice Point Counting Kahle, Thomas Michalek, Mateusz terms-of-use 2016 2021-01-15T09:45:18Z

This item appears in the following Collection(s)

Search KOPS


My Account