Abstract
The Gerstenhaber Problem (GP) asks whether Gerstenhaber’s surprising 1961 theorem for two commuting matrices extends to three commuting n × n matrices A, B, C over a field F: must the (unital) subalgebra of generated by A, B, C have dimension at most n? We show the GP reduces to the prime fields and . Moreover, the GP is “decidable” in terms of Turing computability (a huge reduction in complexity). We also provide some more evidence pointing to a negative answer to the problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
