Polynomial identities of Euler's graphs and matrix rings. (Q2431872)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial identities of Euler's graphs and matrix rings. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial identities of Euler's graphs and matrix rings. |
scientific article |
Statements
Polynomial identities of Euler's graphs and matrix rings. (English)
0 references
24 October 2006
0 references
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\).
0 references
Eulerian graphs
0 references
Eulerian paths
0 references
Amitsur-Levitzki theorem
0 references
0.9348299
0 references
0.9075493
0 references
0 references
0.8906506
0 references
0.8866941
0 references
0.88510156
0 references