English

On the Skolem Problem and Prime Powers

Number Theory 2020-06-16 v1 Computational Complexity

Abstract

The Skolem Problem asks, given a linear recurrence sequence (un)(u_n), whether there exists nNn\in\mathbb{N} such that un=0u_n=0. In this paper we consider the following specialisation of the problem: given in addition cNc\in\mathbb{N}, determine whether there exists nNn\in\mathbb{N} of the form n=lpkn=lp^k, with k,lck,l\leq c and pp any prime number, such that un=0u_n=0.

Keywords

Cite

@article{arxiv.2006.07432,
  title  = {On the Skolem Problem and Prime Powers},
  author = {George Kenison and Richard Lipton and Joël Ouaknine and James Worrell},
  journal= {arXiv preprint arXiv:2006.07432},
  year   = {2020}
}

Comments

13 pages, ISSAC 2020

R2 v1 2026-06-23T16:17:22.053Z