当前位置: X-MOL 学术Commun. Algebra › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Corrigendum: The Gerstenhaber problem for commuting triples of matrices is “decidable”
Communications in Algebra ( IF 0.7 ) Pub Date : 2021-07-15 , DOI: 10.1080/00927872.2021.1948557
Kevin C. O’Meara 1
Affiliation  

Abstract

I correct a slip in an argument in the above paper. This does not affect the main result: the Gerstenhaber Problem is Turing computable for all fields.



中文翻译:

更正:用于交换矩阵三元组的 Gerstenhaber 问题是“可判定的”

摘要

我更正了上述论文中的一个论点。这不会影响主要结果:Gerstenhaber 问题对于所有领域都是图灵可计算的。

更新日期:2021-08-29
down
wechat
bug