Computable identities in the algebra of formal matrices

DOI10.1016/0304-3975(92)90383-QzbMath0762.15006OpenAlexW2067207466MaRDI QIDQ1194321

Mourrain, Bernard

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90383-q

zbMATH Keywords

algorithmCayley-Hamilton theoremcharacteristic polynomialminimal polynomialCayley-Hamilton identityreduction to canonical formformal matrixmultinomial functions

Mathematics Subject Classification ID

Cites Work

• Computing with 2\(\times 2\) matrices
• The invariant theory of \(n\times n\) matrices
• The polynomial identities of matrices
• TRACE IDENTITIES OF FULL MATRIX ALGEBRAS OVER A FIELD OF CHARACTERISTIC ZERO
• The T -Ideals of the Free Ring
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computable identities in the algebra of formal matrices