Matrix Semigroup Freeness Problems in SL (2, \mathbb Z)

In this paper we study decidability and complexity of decision problems on matrices from the special linear group SL(2,Z). In particular, we study the freeness problem: given a finite set of matrices G generating a multiplicative semigroup S, decide whether each element of S has at most one factorization over G. In other words, is G a code? We show that the problem of deciding whether a matrix semigroup in SL(2,Z) is non-free is NP-hard. Then, we study questions about the number of factorizations of matrices in the matrix semigroup such as the finite freeness problem, the recurrent matrix problem, the unique factorizability problem, etc. Finally, we show that some factorization problems could be even harder in SL(2,Z), for example we show that to decide whether every prime matrix has at most k factorizations is PSPACE-hard.

[1]  Thomas Noll.  Musical intervals and special linear transformations , 2007 .

[2]  Imre Simon,et al.  On Finite Semigroups of Matrices , 1977, Theor. Comput. Sci..

[3]  Tero Harju,et al.  Undecidability Bounds for Integer Matrices Using Claus Instances , 2007, Int. J. Found. Comput. Sci..

[4]  Paul E. Schupp,et al.  Membership Problem for the Modular Group , 2007, SIAM J. Comput..

[5]  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..

[6]  Leonid Polterovich,et al.  Stable mixing for cat maps and quasi-morphisms of the modular group , 2004, Ergodic Theory and Dynamical Systems.

[7]  Andrzej Kisielewicz,et al.  On the problem of freeness of multiplicative matrix semigroups , 2010, Theor. Comput. Sci..

[8]  Igor Potapov,et al.  Mortality for 2×2 Matrices Is NP-Hard , 2012, MFCS.

[9]  Igor Potapov,et al.  Reachability Problems in Quaternion Matrix and Rotation Semigroups , 2007, MFCS.

[10]  Gerhard J. Woeginger,et al.  On the Equal-Subset-Sum Problem , 1992, Inf. Process. Lett..

[11]  François Nicolas,et al.  On the decidability of semigroup freeness , 2008, RAIRO Theor. Informatics Appl..

[12]  Fritz Grunewald,et al.  Arithmetic Applications of the Hyperbolic Lattice Point Theorem , 1988 .

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

[14]  Juha Honkala,et al.  The freeness problem over matrix semigroups and bounded languages , 2014, Inf. Comput..

[15]  Jean-Camille Birget,et al.  On the Undecidability of the Freeness of Integer Matrix Semigroups , 1991, Int. J. Algebra Comput..

[16]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

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

[18]  Igor Potapov,et al.  Periodic and Infinite Traces in Matrix Semigroups , 2008, SOFSEM.

[19]  Igor Potapov,et al.  Vector Reachability Problem in SL(2, Z) , 2016, MFCS.

[20]  Igor Potapov,et al.  The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete , 2017, SODA.

[21]  Jeffrey Shallit,et al.  A Second Course in Formal Languages and Automata Theory , 2008 .

[22]  Fernando Chamizo.  Non-Euclidean visibility problems , 2006 .

[23]  Don Zagier,et al.  Elliptic modular forms and their applications. , 2008 .

[24]  Charles F. Miller,et al.  Combinatorial Group Theory , 2002 .

[25]  Edward Witten.  SL(2;Z) Action On Three-Dimensional Conformal Field Theories With Abelian Symmetry , 2003 .

[26]  Juhani Karhumäki,et al.  On the Undecidability of Freeness of Matrix Semigroups , 1999, Int. J. Algebra Comput..

[27]  Igor Potapov.  Composition Problems for Braids , 2013, FSTTCS.

[28]  A. Restuccia,et al.  SL(2, Z) symmetries, supermembranes and symplectic torus bundles , 2011, 1105.3181.

[29]  Vincent D. Blondel,et al.  Problem 10.3 Freeness of multiplicative matrix semigroups , 2009 .

[30]  Igor Potapov.  From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata , 2004, Developments in Language Theory.

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

[32]  A New Twist in Knot Theory , 2009 .