This item is non-discoverable
Loading...
Non-discoverable
Detecting infinitely many semisimple representations in a fixed finite dimension
Letzter, ES
Letzter, ES
Citations
Altmetric:
Genre
Journal Article
Date
2008-12-01
Advisor
Committee member
Group
Department
Permanent link to this record
Collections
Research Projects
Organizational Units
Journal Issue
DOI
10.1016/j.jalgebra.2008.06.035
Abstract
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.
Description
Citation
Citation to related work
Elsevier BV
Has part
Journal of Algebra
ADA compliance
For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu