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:Combinatorics Seminar
SUMMARY:Generalized sum-product phenomenon and group confi
gurations - Emmanuel Breuillard (University of Cam
bridge)
DTSTART;TZID=Europe/London:20180301T143000
DTEND;TZID=Europe/London:20180301T153000
UID:TALK96862AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/96862
DESCRIPTION:A large finite set of numbers must grow under eith
er\naddition or multiplication (sum-product phenom
enon) and more generally under any polynomial map
which is not of a special form coming either from
addition only or from multiplication only. Several
years ago Elekes and Szabo have shown more genera
lly that if an algebraic constraint is satisfied b
y too many triples of numbers from the same\nfinit
e set\, then this algebraic constraint must come f
rom the graph of a group operation. In joint work
with Martin Bays (Muenster) we present a new appro
ach to this problem which enables us to completely
classify the type of constraints that can arise i
n all dimensions and all arities.\n
LOCATION:MR12
CONTACT:Andrew Thomason
END:VEVENT
END:VCALENDAR