# Polynomial degree bounds for matrix semi-invariants

@article{Derksen2015PolynomialDB,
title={Polynomial degree bounds for matrix semi-invariants},
author={Harm Derksen and Visu Makam},
journal={ArXiv},
year={2015},
volume={abs/1512.03393}
}
• Published 10 December 2015
• Mathematics
• ArXiv

### Weyl's polarization theorem for matrix semi-invariants in positive characteristic

• Mathematics
• 2018
Consider the ring of invariants $R(n,m)$ for the left-right action of ${\rm SL}_n \times {\rm SL}_n$ on $m$-tuples of $n \times n$ matrices. It was recently proved that the ring $R(n,m)$ is generated

### Determinantal hypersurfaces and representations of Coxeter groups

• Mathematics
Pacific Journal of Mathematics
• 2021

### Non-commutative Edmonds’ problem and matrix semi-invariants

• Mathematics, Computer Science
computational complexity
• 2016
This paper considers the non-commutative version of Edmonds’ problem: compute the rank of T over the free skew field by using an algorithm of Gurvits, and assuming the above bound of sigma for R(n, m) over Q, deciding whether or not T has non-Commutative rank < n over Q can be done deterministically in time polynomial in the input size and $$sigma}$$σ.

### Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients

• Mathematics
• 2000
Σ(Q,α) is defined in the space of all weights by one homogeneous linear equation and by a finite set of homogeneous linear inequalities. In particular the set Σ(Q,α) is saturated, i.e., if nσ ∈

### Non-commutative arithmetic circuits with division

• Mathematics
Theory Comput.
• 2014
It is shown how divisions can be eliminated from non-commutative circuits and formulae which compute polynomials, and the non-Commutative version of the "rational function identity testing" problem is addressed.

### Reductive groups are geometrically reductive

Let G be a semi-simple algebraic group over an algebraically closed field, k. Let G act rationally by automorphisms on the finitely generated k-algebra, R. The problem of proving that the ring of

### A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing

• Mathematics, Computer Science
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
A deterministic polynomial time algorithm for testing if a symbolic matrix in non-commuting variables over Q is invertible or not, which efficiently solves several problems in different areas which had only exponential-time algorithms prior to this work.

### Invariant functions on matrices

• S. Donkin
• Mathematics
Mathematical Proceedings of the Cambridge Philosophical Society
• 1993
The ring of symmetric polynomials in n variables may be interpreted as a ring of characters of the general linear group GL(n) (see e.g. [4], §3·5). We consider here a generalization of symmetric

### Lower bounds for non-commutative computation

• N. Nisan
• Computer Science, Mathematics
STOC '91
• 1991
The question of the power of negation in this model is shown to be closely related to a well known open problem relating communication complexity and rank, and exponential lower bounds for monotone algebraic circuit size are obtained.