BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Discrete Analysis Seminar
SUMMARY:Higher-rank Bohr sets and multiplicative diophanti
ne approximation - Niclas Technau\, University of
York
DTSTART;TZID=Europe/London:20181128T134500
DTEND;TZID=Europe/London:20181128T144500
UID:TALK114064AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/114064
DESCRIPTION:Gallagher's theorem is a sharpening and extension
of the Littlewood conjecture that holds for almost
all tuples of real numbers. This talk is about jo
int work with Sam Chow where we provide a fibre re
finement\, solving a problem posed by Beresnevich\
, Haynes and Velani in 2015. Hitherto\, this was o
nly known on the plane\, as previous approaches re
lied heavily on the theory of continued fractions.
Using reduced successive minima in lieu of conti
nued fractions\, we develop the structural theory
of Bohr sets of arbitrary rank\, in the context of
diophantine approximation.
LOCATION:MR5\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
CONTACT:Aled Walker
END:VEVENT
END:VCALENDAR