Matrix mortality problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In computer science, the matrix mortality problem (or mortal matrix problem) is a decision problem that asks, given a set of size m of n×n matrices with integer coefficients, whether the zero matrix can be expressed as a finite product of matrices from this set.

The matrix mortality problem is known to be undecidable when n ≥ 3.[1] In fact, it is already undecidable for sets of 6 matrices (or more) when n = 3, for 4 matrices when n = 5, for 3 matrices when n = 9, and for 2 matrices when n = 15.[2]

In the case n = 2, it is an open problem whether matrix mortality is decidable, but several special cases have been solved: the problem is decidable for sets of 2 matrices,[3] and for sets of matrices which contain at most one invertible matrix.[4]

The current frontier of knowledge
n\m 1 2 3 4 5 6
2
3 ✖️
4 ✖️
5 ✖️ ✖️ ✖️
... ✖️ ✖️ ✖️
9 ✖️ ✖️ ✖️ ✖️
... ✖️ ✖️ ✖️ ✖️
15 ✖️ ✖️ ✖️ ✖️ ✖️

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).>