Permanent link to this recordhttp://hdl.handle.net/20.500.12613/6114
MetadataShow full item record
AbstractLet 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 workElsevier BV
Has partJournal of Pure and Applied Algebra
ADA complianceFor Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact firstname.lastname@example.org