BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jeffrey Shallit (University of Waterloo)
DTSTART:20240508T130000Z
DTEND:20240508T140000Z
DTSTAMP:20260423T021152Z
UID:FLAT/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/FLAT/4/">Usi
 ng automata to prove theorems about sequences</a>\nby Jeffrey Shallit (Uni
 versity of Waterloo) as part of One FLAT World Seminar\n\n\nAbstract\nAuto
 mata have proven very useful in practice\, both for text searching and the
  analysis of various kinds of discrete systems. In this talk\, however\, I
  will show that they are also useful for (rigorously) proving theorems abo
 ut sequences\, and hence become a new and exciting tool for number theoris
 ts and combinatorialists. As an example\, I will talk about a sequence of 
 Benoit Cloitre\, defined by a certain recurrence involving Fibonacci numbe
 rs. Many properties of this sequence were conjectured\, and using automata
  we can now resolve all of them. The proofs are done using Walnut\, a free
  open-source theorem-prover for automatic sequences\, originally designed 
 by Hamoon Mousavi.\n\nThis is joint work with Benoit Cloitre.\n
LOCATION:https://researchseminars.org/talk/FLAT/4/
END:VEVENT
END:VCALENDAR