Abstract
The question of whether a given subspace of ℚd can be reached from a starting vector using linear transformations from a given finite set is well known to be undecidable in dimension 3 and above. We show that, in contrast, the invariance problem, i.e. the question of whether it is possible to remain inside a given subspace indefinitely using linear transformations from a given finite set, is decidable.
Cite
CITATION STYLE
Dräger, K. (2016). The invariance problem for matrix semigroups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9634, pp. 479–492). Springer Verlag. https://doi.org/10.1007/978-3-662-49630-5_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
