Skip to content
DraconiticResearch
Search Sources API
194,226 studies31 sourcesUpdated 57 min ago
PreprintarXiv licencearXiv

Pseudo-Effectivity in the Skolem-Mahler-Lech Theorem

Abstract

The Skolem--Mahler--Lech Theorem asserts that a non-degenerate linear recurrence sequence (LRS) has only finitely many zeros, but is ineffective in the sense that no general procedure is known to determine them. In this paper a \emph{pseudo-effective} approach is introduced: rather than seeking effective bounds for every sequence, one obtains explicit bounds valid for all but a controlled number of sequences of bounded height, up to a natural equivalence. Such results are established for order $3$ LRS's, and extended to all higher orders subject to suitable height constraints on the characteristic roots. The underlying mechanism is a quantitative theory for exponential-polynomial equations subject to low-height multiplicative perturbations. In particular, it is shown that the finiteness phenomenon underlying the Skolem--Mahler--Lech Theorem persists under arithmetic perturbations whose height is permitted to grow linearly at a sufficiently small rate. As a further application, a moving-target finiteness result is established for linear orbits entering expanding arithmetic neighbourhoods of proper linear subspaces.

Related

  1. Skolem-Mahler-Lech in rings of positive characteristic: a shorter proof and a multi-dimensional generalization
    Ruiwen Dong, Doron Shafrir
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. IC-rigidity and generalizations of a theorem of Mahler
    Bryna Kra, Scott Schmieding
    arXivPreprintarXiv licenceFull textDynamical systemsarXiv
  3. Mahler Method and Vanishing Theorem
    Kumiko Nishioka, Taka-aki Tanaka, Yusuke Tanuma
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Hard Lefschetz theorem for logarithmic sheaves twisted by pseudo-effective line bundles
    Yuta Watanabe
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  5. Finite-tower bounds for Skolem functions
    Andreas Weiermann
    arXivPreprintCC BY 4.0Full textLogic & foundationsarXiv
BibTeX
@misc{shirandami2026pseudoeffectivity,
  title = {{Pseudo-Effectivity in the Skolem-Mahler-Lech Theorem}},
  author = {Victor Shirandami},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.32901},
  eprint = {2609.32901},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.32901},
}
RIS
TY  - UNPB
TI  - Pseudo-Effectivity in the Skolem-Mahler-Lech Theorem
AU  - Victor Shirandami
PY  - 2026
DA  - 2026/09/26
PB  - arXiv
DO  - 10.48550/arxiv.2609.32901
UR  - https://arxiv.org/abs/2609.32901
AB  - The Skolem--Mahler--Lech Theorem asserts that a non-degenerate linear recurrence sequence (LRS) has only finitely many zeros, but is ineffective in the sense that no general procedure is known to determine them. In this paper a \emph{pseudo-effective} approach is introduced: rather than seeking effective bounds for every sequence, one obtains explicit bounds valid for all but a controlled number of sequences of bounded height, up to a natural equivalence. Such results are established for order $3$ LRS's, and extended to all higher orders subject to suitable height constraints on the characteristic roots. The underlying mechanism is a quantitative theory for exponential-polynomial equations subject to low-height multiplicative perturbations. In particular, it is shown that the finiteness phenomenon underlying the Skolem--Mahler--Lech Theorem persists under arithmetic perturbations whose height is permitted to grow linearly at a sufficiently small rate. As a further application, a moving-target finiteness result is established for linear orbits entering expanding arithmetic neighbourhoods of proper linear subspaces.
ER  -