5 citations · 16 across the 19 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2026
Conjectural Decidability of the Skolem Problem
Florian Luca, Joël Ouaknine, James Worrell
The Skolem Problem asks to determine whether a given integer linear recurrence sequence (LRS) has a zero term. This problem, whose decidability has been open for many decades, aris…
cs.DM2023
Skolem Meets Bateman-Horn
Florian Luca, James Maynard, Armand Noubissie +2
The Skolem Problem asks to determine whether a given integer linear recurrence sequence has a zero term. This problem arises across a wide range of topics in computer science, incl…