当前位置: X-MOL 学术arXiv.cs.CC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the Skolem Problem and Prime Powers
arXiv - CS - Computational Complexity Pub Date : 2020-06-12 , DOI: arxiv-2006.07432
George Kenison, Richard Lipton, Jo\"el Ouaknine, James Worrell

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

中文翻译:

关于 Skolem 问题和素数

Skolem 问题询问,给定一个线性递推序列 $(u_n)$,​​是否存在 $n\in\mathbb{N}$ 使得 $u_n=0$。在本文中,我们考虑问题的以下特化:另外给定 $c\in\mathbb{N}$,确定是否存在形式为 $n=lp^k$ 的 $n\in\mathbb{N}$ , $k,l\leq c$ 和 $p$ 为任意素数,使得 $u_n=0$。
更新日期:2020-06-16
down
wechat
bug