Counting equivalence classes of irreducible representations

MaRDI QIDQ2723254zbMATH OpenFDO

Authors Edward S. Letzter

Publication date 9 July 2001

Published in AMA. Algebra Montpellier Announcements (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0106033, https://eudml.org/doc/121846, http://www.emis.de/journals/AMA/AMA01-2001/index01-2001.html

zbMATH Keywords

algorithmscomputable fieldsfinitely presented algebrasirreducible representationsMarkov propertysubring membership test

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Representation type (finite, tame, wild, etc.) of associative algebras (16G60) Computational aspects of associative rings (general theory) (16Z05) Symbolic computation and algebraic computation (68W30)

Review text

Let \(k\) be a computable field of characteristic 0 and \(R\) a finitely presented \(k\)-algebra. The article describes an algorithm which decides whether given a natural number \(n\) there exist only finitely many (up to isomorphism) irreducible \(n\)-dimensional representations of \(R\). By a representation it is meant an algebra homomorphism from \(R\) into the \(n\times n\)-matrix algebra \(M_n(\overline k)\) with coefficients in the algebraic closure of \(k\). Irreducibility as well as isomorphisms are also defined over \(\overline k\).NEWLINENEWLINENEWLINEThe algorithm uses in particular a variant of the subring membership test [see \textit{T. Becker, V. Weispfenning}, Gröbner bases: a computational approach to commutative algebra, Graduate Texts in Mathematics 141 (1993; Zbl 0772.13010)]. The author sketches also a method of calculating the number of isomorphism classes of irreducible \(n\)-dimensional representations of \(R\) in case this number is finite and \(k[t]\) is equipped with a factoring algorithm.NEWLINENEWLINENEWLINENote that in a previous paper [J. Symb. Comput. 32, No. 3, 255-262 (2001; see the preceding review Zbl 0987.16008)] the author has given a procedure to verify whether \(R\) has an \(n\)-dimensional irreducible representation for a given \(n\). Moreover, the existence of a nonzero finite dimensional representation of \(R\) is a Markov property and cannot be algorithmically verified in general by the result of \textit{L. A. Bokut'} [Algebra Logika 9, 137-144 (1970; Zbl 0216.01001)].

Recommendations

• Constructing irreducible representations of finitely presented algebras
• Detecting infinitely many semisimple representations in a fixed finite dimension.
• Computing Irreducible Representations of Finite Groups
• CONSTRUCTING FULL BLOCK TRIANGULAR REPRESENTATIONS OF ALGEBRAS
• Effective detection of nonsplit module extensions.

Cited in

(3)

• Effective detection of nonsplit module extensions.
• On the Class Number of Representations of an Order
• Detecting infinitely many semisimple representations in a fixed finite dimension.

This page was built for publication: Counting equivalence classes of irreducible representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723254)