Constructing irreducible representations of finitely presented algebras

1999/10/25 by Edward S. Letzter, Letzter, Edward S.
Mathematics · #13P10 #16-08 #Commutative Algebra (math.AC) #FOS: Mathematics #Representation Theory (math.RT) #Rings and Algebras (math.RA) #math.AC #math.RA #math.RT #msc:13P10 #msc:16-08

paper · pdf · doi:10.48550/arxiv.math/9910132

9 pages. Final version. To appear in J. Symbolic Computation

arxiv created 2001/06/06 · arxiv updated 2009/11/30

Abstract

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In slightly more detail: Assume that n is a positive integer, that k is a computable field, that k denotes the algebraic closure of k, and that M_n(k) denotes the algebra of n × n matrices with entries in k. Let R be a finitely presented k-algebra. Calculating over k, the procedure will (a) decide whether an irreducible representation R → M_n(k) exists, and (b) explicitly construct an irreducible representation R → M_n(k) if at least one exists. (For (b), it is necessary to assume that k[x] is equipped with a factoring algorithm.) An elementary example is worked through.

Related

• Counting equivalence classes of irreducible representations
• Detecting Infinitely Many Semisimple Representations in a Fixed Finite Dimension
• Infinite dimensional representations of finite dimensional algebras and amenability
• Embeddings of representations
• Generalised Burnside and Dixon algorithms for irreducible projective representations