CONSTRUCTING FULL BLOCK TRIANGULAR REPRESENTATIONS OF ALGEBRAS

DOI10.1142/S021949880700217XzbMath1117.15010OpenAlexW2097756367MaRDI QIDQ3442745

Daniel Birmajer

Publication date: 23 May 2007

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021949880700217x

zbMATH Keywords

indecomposable representationsstandard identitiesalgorithmic testfull block triangular representation

Mathematics Subject Classification ID

Representations of orders, lattices, algebras over commutative rings (16G30) Matrix equations and identities (15A24) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cites Work

• An upper bound for the length of a finite-dimensional algebra
• On subalgebras of \(n \times n\) matrices not satisfying identities of degree \(2n - 2\)
• Effective detection of nonsplit module extensions.
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• An application of the Cayley-Hamilton theorem to matrix polynomials in several variables
• Constructing irreducible representations of finitely presented algebras

This page was built for publication: CONSTRUCTING FULL BLOCK TRIANGULAR REPRESENTATIONS OF ALGEBRAS