BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Joël Ouaknine (Max Planck Institute for Software Systems)
DTSTART:20240312T130000Z
DTEND:20240312T140000Z
DTSTAMP:20260423T053047Z
UID:OWNS/127
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OWNS/127/">T
 he Skolem Landscape</a>\nby Joël Ouaknine (Max Planck Institute for Softw
 are Systems) as part of One World Numeration seminar\n\n\nAbstract\nThe Sk
 olem Problem asks how to determine algorithmically whether a given linear 
 recurrence sequence (such as the Fibonacci numbers) has a zero. It is a ce
 ntral question in dynamical systems and number theory\, and has many conne
 ctions to other branches of mathematics and computer science. Unfortunatel
 y\, 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 q
 uestions\, including recent and ongoing developments.\n
LOCATION:https://researchseminars.org/talk/OWNS/127/
END:VEVENT
END:VCALENDAR