Thumbnail Image
Non-discoverable
Item

Constructing irreducible representations of finitely presented algebras

Letzter, ES
Citations
Altmetric:
Genre
Journal Article
Date
2001-01-01
Advisor
Committee member
Group
Department
Subject
math.RA
 math.RA
 math.AC
 math.RT
 16-08;13P10
Permanent link to this record
http://hdl.handle.net/20.500.12613/6131
Collections
Faculty/Researcher Works
Show all metadata
Files
Thumbnail Image
9910132v4.pdf
Adobe PDF, 129.12 KB
Research Projects
Organizational Units
Journal Issue
DOI
10.1006/jsco.2001.0445
Abstract
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.
Description
Citation
Citation to related work
Elsevier BV
Has part
Journal of Symbolic Computation
ADA compliance
For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu
Embedded videos