Vector reachability problem in SL (2, ℤ)

Conference item

The decision problems on matrices were intensively studied for many decades as matrix products play an essential role in the representation of various computational processes. However, many computational problems for matrix semigroups are inherently difficult to solve even for problems in low dimensions and most matrix semigroup problems become undecidable in general starting from dimension three or four. This paper solves two open problems about the decidability of the vector reachability problem over a finitely generated semigroup of matrices from SL(2, ℤ) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are from SL(2, ℤ). The approach to solving reachability problems is based on the characterization of reachability paths between points which is followed by the translation of numerical problems on matrices into computational and combinatorial problems on words and formal languages. We also give a geometric interpretation of reachability paths and extend the decidability results to matrix products represented by arbitrary labelled directed graphs. Finally, we will use this technique to prove that a special case of the scalar reachability problem is decidable.

Authors: Potapov, I; Semukhin, P

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Schloss Dagstuhl
• Host title: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
• Journal: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
• Volume: 58
• Pages: 84:1--84:14
• Publication date: 2016-08-19
• Acceptance date: 2016-06-05
• DOI: 10.4230/LIPIcs.MFCS.2016.84
• ISSN: 1868-8969
• ISBN: 9783959770163
• Keywords: linear fractional transformation; vector reachability problem; automata and formal languages; special linear group; matrix semigroup