Representations of Algebras: Some Computational Aspects

Let n ϵ Z≥1 and R be a finitely presented k-algebra over a computable field k. We describe algorithms for computably deciding representation-theoretic properties of R, following work by Letzter. Among these algorithms is an algorithm deciding whether an n-dimensional irreducible representation exists. We also provide a package, finitely-presented-algebra, which implements these algorithms into the computer algebra system SAGE.

Grantor dc:publisher

Temple University. Libraries

Year dc:date.issued

2019

Author dc:creator

• Rhoads, Kyle James

Advisor dc:contributor.advisor

• Letzter, E. S. (Edward S.), 1958-

Committee members dc:contributor.committeemember

• Dolgushev, Vasily
• Lorenz, Martin, 1951-

• Mathematics

Statement dc:rights

• IN COPYRIGHT- This Rights Statement can be used for an Item that is in copyright. Using this statement implies that the organization making this Item available has determined that the Item is in copyright and either is the rights-holder, has obtained permission from the rights-holder(s) to make their Work(s) available, or makes the Item available under an exception or limitation to copyright (including Fair Use) that entitles it to make the Item available.

Licence dc:rights.uri

• http://rightsstatements.org/vocab/InC/1.0/

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/20.500.12613/2237

OAI identifier oai:identifier

oai:scholarshare.temple.edu:20.500.12613/2237