Constructing irreducible representations of finitely presented algebras
Genre
Journal ArticleDate
2001-01-01Author
Letzter, ESPermanent link to this record
http://hdl.handle.net/20.500.12613/6131
Metadata
Show full item recordDOI
10.1006/jsco.2001.0445Abstract
We describe an algorithmic test, using the "standard polynomial identity" (and elementary computational commutative algebra), for determining whether or not a finitely presented associative algebra has an irreducible n-dimensional representation. When n-dimensional irreducible representations do exist, our proposed procedure can (in principle) produce explicit constructions. © 2001 Academic Press.Citation to related work
Elsevier BVHas part
Journal of Symbolic ComputationADA 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/6113