Genre
Journal ArticleDate
2005-06-01Author
Letzter, ESPermanent link to this record
http://hdl.handle.net/20.500.12613/6114
Metadata
Show full item recordDOI
10.1016/j.jpaa.2004.10.013Abstract
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every at most-n-dimensional representation of R is semisimple, and (2) if there exist nonsplit extensions of non-isomorphic irreducible R-modules whose dimensions sum to no greater than n. © Elsevier B.V. All rights reserved.Citation to related work
Elsevier BVHas part
Journal of Pure and Applied 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/6096