English

Polynomial degree bounds for matrix semi-invariants

Representation Theory 2015-12-11 v1 Computational Complexity

Abstract

We study the left-right action of SLn×SLn\operatorname{SL}_n \times \operatorname{SL}_n on mm-tuples of n×nn \times n matrices with entries in an infinite field KK. We show that invariants of degree n2nn^2- n define the null cone. Consequently, invariants of degree n6\leq n^6 generate the ring of invariants if char(K)=0\operatorname{char}(K)=0. We also prove that for m0m \gg 0, invariants of degree at least nn+1n\lfloor \sqrt{n+1}\rfloor are required to define the null cone. We generalize our results to matrix invariants of mm-tuples of p×qp\times q matrices, and to rings of semi-invariants for quivers. For the proofs, we use new techniques such as the regularity lemma by Ivanyos, Qiao and Subrahmanyam, and the concavity property of the tensor blow-ups of matrix spaces. We will discuss several applications to algebraic complexity theory, such as a deterministic polynomial time algorithm for non-commutative rational identity testing, and the existence of small division-free formulas for non-commutative polynomials.

Keywords

Cite

@article{arxiv.1512.03393,
  title  = {Polynomial degree bounds for matrix semi-invariants},
  author = {Harm Derksen and Visu Makam},
  journal= {arXiv preprint arXiv:1512.03393},
  year   = {2015}
}

Comments

16 pages

R2 v1 2026-06-22T12:06:40.497Z