62 citations · 222 across the 34 of their papers we have counts for
6 papers · 1 filter
Rectangular Kronecker coefficients and plethysms in geometric complexity theory
Christian Ikenmeyer, Greta Panova
We prove that in the geometric complexity theory program the vanishing of rectangular Kronecker coefficients cannot be used to prove superpolynomial determinantal complexity lower…
Fundamental invariants of orbit closures
Peter Bürgisser, Christian Ikenmeyer
For several objects of interest in geometric complexity theory, namely for the determinant, the permanent, the product of variables, the power sum, the unit tensor, and the matrix…
On McKay's propagation theorem for the Foulkes conjecture
Christian Ikenmeyer
We translate the main theorem in Tom McKay's paper "On plethysm conjectures of Stanley and Foulkes" (J. Alg. 319, 2008, pp. 2050-2071) to the language of weight spaces and projecti…
Symmetrizing Tableaux and the 5th case of the Foulkes Conjecture
Man-Wai Cheung, Christian Ikenmeyer, Sevak Mkrtchyan
The Foulkes conjecture states that the multiplicities in the plethysm Sym^a(Sym^b V) are at most as large as the multiplicities in the plethysm Sym^b(Sym^a V) for all a <= b. This…
On vanishing of Kronecker coefficients
Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter
We show that the problem of deciding positivity of Kronecker coefficients is NP-hard. Previously, this problem was conjectured to be in P, just as for the Littlewood-Richardson coe…
Permanent versus determinant: not via saturations
Peter Bürgisser, Christian Ikenmeyer, Jesko Hüttenhain
Let Det_n denote the closure of the GL_{n^2}(C)-orbit of the determinant polynomial det_n with respect to linear substitution. The highest weights (partitions) of irreducible GL_{n…