A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Journal of Algebra
Let n be a positive integer, and let k be a field (of arbitrary characteristic) accessible to symbolic computation. We describe an algorithmic test for determining whether or not a finitely presented k-algebra R has infinitely many equivalence classes of semisimple representations R → M n (k ), where k is the algebraic closure of k. The test reduces the problem to computational commutative algebra over k, via famous results of Artin, Procesi, and Shirshov. The test is illustrated by explicit examples, with n = 3.doi:10.1016/j.jalgebra.2008.06.035 fatcat:dqyaurodvnfrtdkok7p2uecot4