BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability seminar
SUMMARY:Exploiting structure in sets of frequencies - Thom
as Bloom (University of Bristol)
DTSTART:20171114T150000Z
DTEND:20171114T160000Z
UID:TALK2840AT
URL:/talk/index/2840
DESCRIPTION:Many problems in additive combinatorics and theore
tical computer science are amenable to techniques
of Fourier analysis\, which is a powerful way of q
uantifying the well-known dichotomy between struct
ure and randomness. In particular\, if a set of in
tegers does not behave pseudorandomly then it has
many large Fourier coefficients. In the past few y
ears there have been many developments achieved by
treating this set of large Fourier coefficients a
s a subset of an abelian group and applying physic
al combinatorial arguments to extract more useful
information. I will discuss these ideas and their
applications to several problems in additive combi
natorics.
LOCATION:Watson LTA
CONTACT:Guillem Perarnau
END:VEVENT
END:VCALENDAR