Constructing irreducible representations of finitely presented algebras
Permanent link to this recordhttp://hdl.handle.net/20.500.12613/6131
MetadataShow full item record
AbstractWe 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 workElsevier BV
Has partJournal of Symbolic Computation
ADA complianceFor Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact firstname.lastname@example.org