A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is `application/pdf`

.

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

2013
*
Lecture Notes in Computer Science
*

Mulmuley [Mul12a] 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

doi:10.1007/978-3-642-40328-6_37
fatcat:jd4yqz6a7jgdfewml4inacgsvm