Aug 25, 2014 · 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 ...

Aug 7, 2015 · The general goal in plethysm is to determine the coefficients of S λ in S μ ( S ν W ) as a function of the partitions λ , μ , and ν .

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 ...

We apply lattice point counting methods to compute the multiplicities in the plethysm of $GL(n)$. Our approach gives insight into the asymptotic growth ...

It is demonstrated that quasi- polynomials arising in formulas for plethysm need not be counting functions of inhomogeneous polytopes of dimension equal to ...

Parametric lattice point counting is the multivariate generalization. General setup. • Consider any (linear) projection of pointed rational cones. • For each ...

We will present the results of a joint work with Thomas Kahle, where we provide formulas for certain plethysms by relating them to convex polyhedral geometry.

{Irreducible representations of GL(n)}. ↔. {Young diagrams with at most n − 1 rows and an integer}. The correspondence is very classical using Schur ...

Oct 1, 2016 · Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old ...

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 ...