The Gerstenhaber problem for commuting triples of matrices is ``decidable'' (Q4959851)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7187935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Gerstenhaber problem for commuting triples of matrices is ``decidable'' |
scientific article; zbMATH DE number 7187935 |
Statements
The Gerstenhaber problem for commuting triples of matrices is “decidable” (English)
0 references
7 April 2020
0 references
commutative matrix algebras
0 references
computability
0 references
Gerstenhaber's theorem
0 references
0.8471608757972717
0 references
0.8001584410667419
0 references
0.7970224022865295
0 references
0.7882916331291199
0 references
0.7547447681427002
0 references
