The Gerstenhaber problem for commuting triples of matrices is “decidable”

DOI10.1080/00927872.2019.1648649zbMath1436.15018OpenAlexW2968582555MaRDI QIDQ4959851

K. C. O'Meara

Publication date: 7 April 2020

Published in: Communications in Algebra (Search for Journal in Brave)

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

zbMATH Keywords

computabilityGerstenhaber's theoremcommutative matrix algebras

Mathematics Subject Classification ID

Commutativity of matrices (15A27) Commutative rings and modules of finite generation or presentation; number of generators (13E15) Commutative Artinian rings and modules, finite-dimensional algebras (13E10) Applications of computability and recursion theory (03D80) Canonical forms, reductions, classification (15A21)

Related Items (1)

Corrigendum: The Gerstenhaber problem for commuting triples of matrices is “decidable”

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some thoughts on Gerstenhaber's theorem
• New classes of examples satisfying the three matrix analog of Gerstenhaber's theorem
• On varieties of commuting nilpotent matrices
• On dominance and varieties of commuting matrices
• A note on commuting pairs of matrices

This page was built for publication: The Gerstenhaber problem for commuting triples of matrices is “decidable”