Polynomial identities of Euler's graphs and matrix rings.
From MaRDI portal
Publication:2431872
Let \(R\) be the ring of the \(n\times n\) matrices over a fixed commutative ring with 1. The classical theorem due to Amitsur and Levitzki states that the polynomial identity of the least degree for \(R\) is the standard polynomial \(s_{2n}\). There are several proofs to this theorem. One was proposed by Swan and relies on properties of finite graphs. The authors of the paper under review develop ideas from the proof of Swan and obtain several identities for \(R\).
Recommendations
- Eulerian polynomial identities on matrix rings
- Eulerian* -polynomial identities on matrix algebras
- Polynomials and graph homomorphisms
- The graph polynomials and their equivalence
- Polynomial relations between matrices of graphs
- Polynomial identities for matrices over the Grassmann algebra
- Polynomial identity rings.
- scientific article; zbMATH DE number 12922
- Eulerian polynomial identities and algebras satisfying a standard identity
- scientific article; zbMATH DE number 4045942
Cited in
(7)- Eulerian polynomial identities on matrix rings
- On P.I. ring and standard identities
- On a polynomial identity for n n matrices
- Criteria for vanishing of Eulerian polynomials on \(n\times n\) matrices
- A graph theoretical equivalence for Amitsur-Levitzki theorem
- Quasi-Polynomials of Capelli. II
- On a question of G. Bergman and L. Small on Azumaya algebras
This page was built for publication: Polynomial identities of Euler's graphs and matrix rings.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431872)