62 citations · 222 across the 34 of their papers we have counts for
4 papers · 1 filter
Hyperpfaffians and Geometric Complexity Theory
Christian Ikenmeyer, Michael Walter
The hyperpfaffian polynomial was introduced by Barvinok in 1995 as a natural generalization of the well-known Pfaffian polynomial to higher order tensors. We prove that the hyperpf…
Implementing geometric complexity theory: On the separation of orbit closures via symmetries
Christian Ikenmeyer, Umangathan Kandasamy
Understanding the difference between group orbits and their closures is a key difficulty in geometric complexity theory (GCT): While the GCT program is set up to separate certain o…
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory
Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov +2
We study the variety membership testing problem in the case when the variety is given as an orbit closure and the ambient space is the set of all 3-tensors. The first variety that…
On geometric complexity theory: Multiplicity obstructions are stronger than occurrence obstructions
Julian Dörfler, Christian Ikenmeyer, Greta Panova
Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic…