Decidability of the Orbit Problem for logarithmic-dimensional target subspaces and Skolem-hardness for linear-dimensional targets.
6 Yuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, and James Worrell
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Algorithms for deciding existence and computing representations of p-adic zeros in linear recurrence sequences, unconditionally correct with termination guaranteed subject to the p-adic Schanuel Conjecture, applied to decidability of the Simultaneous Skolem Problem.
citing papers explorer
-
On the Subspace Orbit Problem and the Simultaneous Skolem Problem
Decidability of the Orbit Problem for logarithmic-dimensional target subspaces and Skolem-hardness for linear-dimensional targets.
-
On the $p$-adic Skolem Problem
Algorithms for deciding existence and computing representations of p-adic zeros in linear recurrence sequences, unconditionally correct with termination guaranteed subject to the p-adic Schanuel Conjecture, applied to decidability of the Simultaneous Skolem Problem.