Vector Reachability Problem in $\mathrm{SL}(2,\mathbb{Z})$

Potapov, Igor and Semukhin, Pavel
(2015) Vector Reachability Problem in $\mathrm{SL}(2,\mathbb{Z})$. [Internet Publication]

[thumbnail of 1510.03227v1.pdf] Text
1510.03227v1.pdf - Unspecified

Download (586kB)
[thumbnail of licence] Text (licence)
repository-policy-2016-03-31.pdf - Unspecified
Access to this file is embargoed until Unspecified.

Download (77kB)


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 $\mathrm{SL}(2,\mathbb{Z})$ and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are from $\mathrm{SL}(2,\mathbb{Z})$. 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.

Item Type: Internet Publication
Additional Information: Date: 2015 (completed)
Uncontrolled Keywords: cs.FL, cs.FL, cs.CC, F.2.1; F.1.1
Depositing User: Symplectic Admin
Date Deposited: 07 Apr 2016 09:38
Last Modified: 17 Dec 2022 02:26
Related URLs: