A graph theoretical equivalence for Amitsur-Levitzki theorem

DOI10.1080/03081087.2016.1161707MaRDI QIDQ2953397zbMATH OpenOpenAlexFDO

Authors M. Ariannejad

Publication date 4 January 2017

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2016.1161707

zbMATH Keywords

directed graphEulerian trailstandard polynomial

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Eulerian polynomial identities on matrix rings
• A Generalization of a theorem of chang
• Polynomial identities of Euler's graphs and matrix rings.
• The minimal degree standard identity on \(M_nE^2\) and \(M_nE^3\)
• scientific article; zbMATH DE number 1538980

Cites work

• A new proof of the Amitsur-Levitski identity
• Eulerian polynomial identities on matrix rings
• On permanental identities over matrix rings

Cited in

(5)

• Levinson's theorem for graphs. II
• scientific article; zbMATH DE number 5957357 (Why is no real title available?)
• scientific article; zbMATH DE number 1538980 (Why is no real title available?)
• Every planar graph with the Liouville property is amenable
• A graph-theoretic approach to a conjecture of Dixon and Pressman

This page was built for publication: A graph theoretical equivalence for Amitsur-Levitzki theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953397)