BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Sabre//Sabre VObject 4.5.8//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Europe/Zurich
X-LIC-LOCATION:Europe/Zurich
TZURL:http://tzurl.org/zoneinfo/Europe/Zurich
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19810329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19961027T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:news1936@dmi.unibas.ch
DTSTAMP;TZID=Europe/Zurich:20251129T092518
DTSTART;TZID=Europe/Zurich:20251210T141500
SUMMARY:Number Theory Seminar: Alina Ostafe (UNSW)
DESCRIPTION:Title: Counting linear recurrence sequences with zeros and solv
able S-unit equations\\r\\nAbstract: In this talk I will discuss recent jo
int work with Carl Pomerance and Igor Shparlinski where we obtain a tight
upper bound on the number of integer linear recurrence sequences which att
ain a zero value. The argument is based on modular techniques combined wit
h a classical idea of P. Erdos. Using similar ideas\, we also show that on
ly a rather small proportion of linear equations are solvable in elements
of a fixed finitely generated subgroup of a multiplicative group of a numb
er field.\\r\\nAlte Universität - Seminarraum -201
X-ALT-DESC:Title: Counting linear recurrence sequences with zeros and s
olvable S-unit equations
\nAbstract: In this talk I will discuss re
cent joint work with Carl Pomerance and Igor Shparlinski where we obtain a
tight upper bound on the number of integer linear recurrence sequences wh
ich attain a zero value. The argument is based on modular techniques combi
ned with a classical idea of P. Erdos. Using similar ideas\, we also show
that only a rather small proportion of linear equations are solvable in el
ements of a fixed finitely generated subgroup of a multiplicative group of
a number field.
\nAlte Universität - Seminarraum -201
DTEND;TZID=Europe/Zurich:20251210T151500
END:VEVENT
END:VCALENDAR