@inproceedings{10.1145/3373207.3404036,
Abstract = {The Skolem Problem asks, given a linear recurrence sequence (un), whether there exists n ∈ N such that un = 0. In this paper we consider the following specialisation of the problem: given in addition c ∈ N, determine whether there exists n ∈ N of the form n = lpk, with k, l ≤ c and p any prime number, such that un = 0.},
Address = {New York, NY, USA},
Author = {Kenison, George and Lipton, Richard and Ouaknine, Jo\"{e}l and Worrell, James},
BookTitle = {Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation},
File = {On the skolem problem and prime powers - 3373207.3404036 - a - p.pdf},
ISBN = {9781450371001},
Keywords = {skolem problem, recurrence sequences, decidability, algebraic number theory},
Location = {Kalamata, Greece},
Pages = {289--296},
Publisher = {Association for Computing Machinery},
Series = {ISSAC '20},
Title = {On the Skolem Problem and Prime Powers},
URL = {https://doi.org/10.1145/3373207.3404036},
Year = {2020},
bdsk-url-1 = {https://doi.org/10.1145/3373207.3404036},
date-added = {2020-09-29 18:55:14 +0200},
date-modified = {2020-09-29 18:55:14 +0200},
numpages = {8},
doi = {10.1145/3373207.3404036}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A