Constructing irreducible representations of finitely presented algebras

DOI10.1006/JSCO.2001.0445zbMath0987.16008arXivmath/9910132OpenAlexW2024862651MaRDI QIDQ5945291

Edward S. Letzter

Publication date: 20 March 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9910132

zbMATH Keywords

algorithmsirreducible representationsfinitely presented algebras

Mathematics Subject Classification ID

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

Related Items (3)

CONSTRUCTING FULL BLOCK TRIANGULAR REPRESENTATIONS OF ALGEBRAS ⋮ Detecting infinitely many semisimple representations in a fixed finite dimension. ⋮ Effective detection of nonsplit module extensions.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
• Constructing matrix representations of finitely presented groups
• Finite dimensional representations of algebras
• Analysing finitely presented groups by constructing representations
• An upper bound for the length of a finite-dimensional algebra
• On Azumaya algebras and finite dimensional representations of rings
• Central polynomials for matrix rings
• An example of unsolvable just non-cross varieties of groups
• Concomitants etp-uplets de matrices 2 × 2
• Simultaneous similarity of matrices

This page was built for publication: Constructing irreducible representations of finitely presented algebras