Detecting infinitely many semisimple representations in a fixed finite dimension
Permanent link to this recordhttp://hdl.handle.net/20.500.12613/6081
MetadataShow full item record
AbstractLet 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 workElsevier BV
Has partJournal of Algebra
ADA complianceFor Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact firstname.lastname@example.org