113 citations · 317 across the 70 of their papers we have counts for
5 papers · 1 filter
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…
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…
Solvability of Matrix-Exponential Equations
Joël Ouaknine, Amaury Pouly, João Sousa-Pinto +1
We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given square matrices , all…
On the Positivity Problem for Simple Linear Recurrence Sequences
Joel Ouaknine, James Worrell
Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem} asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose c…
Positivity Problems for Low-Order Linear Recurrence Sequences
Joel Ouaknine, James Worrell
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate P…