Detecting infinitely many semisimple representations in a fixed finite dimension
Genre
Journal ArticleDate
2008-12-01Author
Letzter, ESPermanent link to this record
http://hdl.handle.net/20.500.12613/6081
Metadata
Show full item recordDOI
10.1016/j.jalgebra.2008.06.035Abstract
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 → Mn (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. © 2008 Elsevier Inc. All rights reserved.Citation to related work
Elsevier BVHas part
Journal of AlgebraADA compliance
For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.eduae974a485f413a2113503eed53cd6c53
http://dx.doi.org/10.34944/dspace/6063