Search problems in algebraic complexity, GCT, and hardness of generators for invariant rings

We consider the problem of computing succinct encodings of lists of generators for invariant rings for group actions. Mulmuley conjectured that there are always polynomial sized such encodings for invariant rings of SLn (C)-representations. We provide simple examples that disprove this conjecture (under standard complexity assumptions). We develop a general framework, denoted algebraic circuit search problems, that captures many important problems in algebraic complexity and computational invariant theory. This framework encompasses various proof systems in proof complexity and some of the central problems in invariant theory as exposed by the Geometric Complexity Theory (GCT) program, including the aforementioned problem of computing succinct encodings for generators for invariant rings.

[1]  Harm Derksen,et al.  Generating invariant rings of quivers in arbitrary characteristic , 2016, 1610.06617.

[2]  Youming Qiao,et al.  Constructive non-commutative rank computation is in deterministic polynomial time , 2015, computational complexity.

[3]  J. M. Landsberg,et al.  Geometric complexity theory: an introduction for geometers , 2013, ANNALI DELL'UNIVERSITA' DI FERRARA.

[4]  Amir Shpilka,et al.  Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing , 2013, APPROX-RANDOM.

[5]  Amir Yehudayoff,et al.  Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..

[6]  Michel Van den Bergh,et al.  Semi-invariants of quivers for arbitrary dimension vectors , 1999 .

[7]  David L. Wehlau,et al.  Constructive invariant theory for tori , 1993 .

[8]  Harm Derksen,et al.  Algorithms for orbit closure separation for invariants and semi-invariants of matrices , 2018, ArXiv.

[9]  B. M. Fulk.  MATH , 1992 .

[10]  Peter Bürgisser,et al.  Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[11]  Mátyás Domokos,et al.  Semi-invariants of quivers as determinants , 2001 .

[12]  Markus Bläser,et al.  Generalized matrix completion and algebraic natural proofs , 2018, Electron. Colloquium Comput. Complex..

[13]  Harm Derksen,et al.  Polynomial degree bounds for matrix semi-invariants , 2015, ArXiv.

[14]  Avi Wigderson,et al.  Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[15]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[16]  Harm Derksen,et al.  An exponential lower bound for the degrees of invariants of cubic forms and tensor actions , 2019, Advances in Mathematics.

[17]  Avi Wigderson,et al.  Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling , 2018 .

[18]  D. Hilbert,et al.  Ueber die vollen Invariantensysteme , 1893 .

[19]  Avi Wigderson,et al.  Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) , 2019, Electron. Colloquium Comput. Complex..

[20]  Ketan Mulmuley,et al.  Geometric Complexity Theory V: Efficient algorithms for Noether Normalization , 2012 .

[21]  Avi Wigderson,et al.  Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling , 2016, Geometric and Functional Analysis.

[22]  R. Tennant.  Algebra , 1941, Nature.

[23]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[24]  Peter Bürgisser,et al.  Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory , 2017, ITCS.

[25]  Harm Derksen,et al.  Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients , 2000 .

[26]  Manindra Agrawal,et al.  Primality and identity testing via Chinese remaindering , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[27]  Bernd Sturmfels,et al.  Algorithms in invariant theory , 1993, Texts and monographs in symbolic computation.

[29]  Peter Bürgisser,et al.  Fundamental invariants of orbit closures , 2015, ArXiv.

[30]  K. Ramachandra,et al.  Vermeidung von Divisionen. , 1973 .

[31]  Fredrik Meyer,et al.  Representation theory , 2015 .

[32]  Avi Wigderson,et al.  Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing , 2018, STOC.

[33]  D. Hilbert.  Ueber die Theorie der algebraischen Formen , 1890 .

[34]  K. Hensel.  Journal für die reine und angewandte Mathematik , 1892 .

[35]  Ketan Mulmuley,et al.  Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems , 2002, SIAM J. Comput..

[36]  Toniann Pitassi,et al.  Circuit Complexity, Proof Complexity, and Polynomial Identity Testing , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[37]  Leonid Gurvits,et al.  Classical complexity and quantum entanglement , 2004, J. Comput. Syst. Sci..

[38]  Jan Kraj́ıček,et al.  Proof complexity , 2019, Mathematics and Computation.

[39]  J. Urry.  Complexity , 2006, Interpreting Art.

[40]  Joshua A. Grochow,et al.  Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions , 2019, ArXiv.

[41]  Adagba O Henry,et al.  Transformation of Groups , 2012 .

[42]  Bernd Sturmfels,et al.  Algorithms in Invariant Theory (Texts and Monographs in Symbolic Computation) , 2008 .

[43]  Greta Panova,et al.  No occurrence obstructions in geometric complexity theory , 2018, Journal of the American Mathematical Society.

[44]  Ketan Mulmuley,et al.  Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties , 2006, SIAM J. Comput..

[45]  Avi Wigderson,et al.  A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing , 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).