BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Daniel Krenn (Universität Salzburg)
DTSTART:20220301T133000Z
DTEND:20220301T143000Z
DTSTAMP:20260423T021441Z
UID:OWNS/78
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OWNS/78/">$k
 $-regular sequences: Asymptotics and Decidability</a>\nby Daniel Krenn (Un
 iversität Salzburg) as part of One World Numeration seminar\n\n\nAbstract
 \nA sequence $x(n)$ is called $k$-regular\, if the set of subsequences $x(
 k^j n + r)$ is contained in a finitely generated module. In this talk\, we
  will consider the asymptotic growth of $k$-regular sequences. When is it 
 possible to compute it? ...and when not? If possible\, how precisely can w
 e compute it? If not\, is it just a lack of methods or are the underlying 
 decision questions recursively solvable (i.e.\, decidable in a computation
 al sense)? We will discuss answers to these questions. To round off the pi
 cture\, we will consider further decidability questions around $k$-regular
  sequences and the subclass of $k$-automatic sequences.\n\nThis is based o
 n joint works with Clemens Heuberger and with Jeffrey Shallit.\n
LOCATION:https://researchseminars.org/talk/OWNS/78/
END:VEVENT
END:VCALENDAR