Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties)

09/02/2019
by   Visu Makam, et al.
0

The following multi-determinantal algebraic variety plays a central role in algebra, algebraic geometry and computational complexity theory: SING_n,m, consisting of all m-tuples of n× n complex matrices which span only singular matrices. In particular, an efficient deterministic algorithm testing membership in SING_n,m will imply super-polynomial circuit lower bounds, a holy grail of the theory of computation. A sequence of recent works suggests such efficient algorithms for memberships in a general class of algebraic varieties, namely the null cones of linear group actions. Can this be used for the problem above? Our main result is negative: SING_n,m is not the null cone of any (reductive) group action! This stands in stark contrast to a non-commutative analog of this variety, and points to an inherent structural difficulty of SING_n,m. To prove this result we identify precisely the group of symmetries of SING_n,m. We find this characterization, and the tools we introduce to prove it, of independent interest. Our work significantly generalizes a result of Frobenius for the special case m=1, and suggests a general method for determining the symmetries of algebraic varieties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2023

Representing the Special Linear Group with Block Unitriangular Matrices

We prove that every element of the special linear group can be represent...
research
04/26/2017

Computing representation matrices for the action of Frobenius to cohomology groups

This paper is concerned with the computation of representation matrices ...
research
11/21/2017

Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory

Alternating minimization heuristics seek to solve a (difficult) global o...
research
02/22/2021

Polymorphic Automorphisms and the Picard Group

We investigate the concept of definable, or inner, automorphism in the l...
research
08/31/2020

Edmonds' problem and the membership problem for orbit semigroups of quiver representations

A central problem in algebraic complexity, posed by J. Edmonds, asks to ...
research
11/15/2019

Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative?

We introduce the binary value principle which is a simple subset-sum ins...
research
02/26/2020

On the complexity of evaluating highest weight vectors

Geometric complexity theory (GCT) is an approach towards separating alge...

Please sign up or login with your details

Forgot password? Click here to reset