Mortality for 2×2 Matrices Is NP-Hard

We study the computational complexity of determining whether the zero matrix belongs to a finitely generated semigroup of two dimensional integer matrices (the mortality problem). We show that this problem is NP-hard to decide in the two-dimensional case by using a new encoding and properties of the projective special linear group. The decidability of the mortality problem in two dimensions remains a long standing open problem although in dimension three is known to be undecidable as was shown by Paterson in 1970. We also show a lower bound on the minimum length solution to the Mortality Problem, which is exponential in the number of matrices of the generator set and the maximal element of the matrices.

[1]  Jean-Camille Birget,et al.  Two-letter group codes that preserve aperiodicity of inverse finite automata , 2007 .

[2]  Emanuele Rodaro,et al.  Mortality Problem for 2×2 Integer Matrices , 2008, SOFSEM.

[3]  J. Tsitsiklis,et al.  The boundedness of all products of a pair of matrices is undecidable , 2000 .

[4]  Jin-Yi Cai,et al.  The bounded membership problem of the monoidSL2(N) , 2005, Mathematical systems theory.

[5]  M. Paterson.  Unsolvability in 3 × 3 Matrices , 1970 .

[6]  Igor Potapov,et al.  On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups , 2010, Int. J. Found. Comput. Sci..

[7]  Jeffrey Shallit,et al.  Automata and Reduced Words in the Free Group , 2009, ArXiv.

[8]  R. Rankin.  Modular Forms and Functions , 1977 .

[9]  Christian Choffrut,et al.  Some decision problems on integer matrices , 2005, RAIRO Theor. Informatics Appl..

[10]  Melven R. Krom.  An unsolvable problem with products of matrices , 2005, Mathematical systems theory.

[11]  Mária Bieliková,et al.  SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings , 2008, SOFSEM.

[12]  Olivier Bournez,et al.  The Mortality Problem for Matrices of Low Dimensions , 2002, Theory of Computing Systems.

[13]  Mark A. Miller.  Mortality for Sets of 2 × 2 Matrices , 1994 .

[14]  John N. Tsitsiklis,et al.  When is a Pair of Matrices Mortal? , 1997, Inf. Process. Lett..

[15]  Igor Potapov,et al.  On the Computational Complexity of Matrix Semigroup Problems , 2012, Fundam. Informaticae.