Joël Ouaknine

activity

20072026

most citedOn the decidability and complexity of Metric Temporal Logic over finite words

113 citations · 260 across the 57 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.FL2023

Transcendence of Sturmian Numbers over an Algebraic Base

Florian Luca, Joel Ouaknine, James Worrell

We consider numbers of the form $S_{β} (u) := \sum_{n = 0}^{\infty} \frac{u _{n}}{β ^{n}}$ for $u = ⟨ u_{n} ⟩_{n = 0}^{\infty}$ a Sturmian sequence over a binary alp…

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…

math.DS2023

Reachability in Injective Piecewise Affine Maps

Faraz Ghahremani, Edon Kelmendi, Joël Ouaknine

One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two interva…