Implementing geometric complexity theory: On the separation of orbit closures via symmetries
Christian Ikenmeyer, Umangathan Kandasamy

TL;DR
This paper advances geometric complexity theory by establishing a method to differentiate orbit closures of specific polynomials using symmetry groups and representation theory, introducing a novel multiplicity obstruction.
Contribution
It provides the first implementation of separating orbit closures via symmetry group comparison, extending GCT techniques beyond previous occurrence-based obstructions.
Findings
Separated orbit closures of power sum and product of variables using symmetry groups
Introduced a new multiplicity obstruction not based on occurrence or vanishing ideals
Utilized Young tableaux to describe coordinate rings of orbit closures
Abstract
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 orbit closures, many beautiful mathematical properties are only known for the group orbits, in particular close relations with symmetry groups and invariant spaces, while the orbit closures seem much more difficult to understand. However, in order to prove lower bounds in algebraic complexity theory, considering group orbits is not enough. In this paper we tighten the relationship between the orbit of the power sum polynomial and its closure, so that we can separate this orbit closure from the orbit closure of the product of variables by just considering the symmetry groups of both polynomials and their representation theoretic decomposition coefficients. In a natural way our construction yields a…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
