Implementing Geometric Complexity Theory: On the Separation of Orbit Closures via Symmetries



Ikenmeyer, Christian and Kandasamy, Umangathan
(2020) Implementing Geometric Complexity Theory: On the Separation of Orbit Closures via Symmetries. PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), abs/19. pp. 713-726.

[img] Text
1911.03990v1.pdf - Author Accepted Manuscript

Download (690kB) | Preview

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 multiplicity obstruction that is neither an occurrence obstruction, nor a so-called vanishing ideal occurrence obstruction. All multiplicity obstructions so far have been of one of these two types. Our paper is the first implementation of the ambitious approach that was originally suggested in the first papers on geometric complexity theory by Mulmuley and Sohoni (SIAM J Comput 2001, 2008): Before our paper, all existence proofs of obstructions only took into account the symmetry group of one of the two polynomials (or tensors) that were to be separated. In our paper the multiplicity obstruction is obtained by comparing the representation theoretic decomposition coefficients of both symmetry groups. Our proof uses a semi-explicit description of the coordinate ring of the orbit closure of the power sum polynomial in terms of Young tableaux, which enables its comparison to the coordinate ring of the orbit.

Item Type: Article
Additional Information: 47 pages
Uncontrolled Keywords: Geometric complexity theory, group orbit, orbit closure, multiplicity obstruction
Depositing User: Symplectic Admin
Date Deposited: 23 Jul 2020 08:14
Last Modified: 23 Jan 2023 19:54
DOI: 10.1145/3357713.3384257
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3094891