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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
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.