Deciding subspace reachability problems with application to Skolem's Problem

Samuel Everett

The higher-dimensional version of Kannan and Lipton's Orbit Problem asks whether it is decidable if a target subspace can be reached from a starting point under repeated applicatio…