Matrix (geometric sum) orbit problem

48 Views Asked by At

Is the following algorithmic problem known to be decidable/undecidable?

Input: an element $\mathbf{v} \in \mathbb{Z}^n$, a matrix $\mathbf{A} \in GL_n(\mathbb{Z})$, and a subgroup $H \leqslant \mathbb{Z}^n$.

Decide: whether there exists an integer $k>0$ such that \begin{equation} \mathbf{v} \left( \sum_{i=0}^{k} \mathbf{A}^i \right) \in H \, . \end{equation}