The Skolem Landscape
Joël Ouaknine (Max Planck Institute for Software Systems)
Abstract: The Skolem Problem asks how to determine algorithmically whether a given linear recurrence sequence (such as the Fibonacci numbers) has a zero. It is a central question in dynamical systems and number theory, and has many connections to other branches of mathematics and computer science. Unfortunately, its decidability has been open for nearly a century! In this talk, I will present a survey of what is known on the Skolem Problem and related questions, including recent and ongoing developments.
dynamical systemsnumber theory
Audience: researchers in the topic
( slides )
Series comments: Description: Online seminar on numeration systems and related topics
For questions or subscribing to the mailing list, contact the organisers at numeration@irif.fr
| Organizers: | Shigeki Akiyama, Ayreena Bakhtawar, Karma Dajani, Kevin Hare, Hajime Kaneko, Niels Langeveld, Lingmin Liao, Wolfgang Steiner* |
| *contact for this listing |