The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
[article]

2013
*
arXiv
*
pre-print

Mulmuley recently gave an explicit version of Noether's Normalization lemma for ring of invariants of matrices under simultaneous conjugation, under the conjecture that there are deterministic black-box algorithms for polynomial identity testing (PIT). He argued that this gives evidence that constructing such algorithms for PIT is beyond current techniques. In this work, we show this is not the case. That is, we improve Mulmuley's reduction and correspondingly weaken the conjecture regarding

arXiv:1303.0084v2
fatcat:mvpzlhkjnnelri4s6nezomojoe