BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Additive triples of permutations - Freddie Manners (University of 
 Oxford)
DTSTART:20160128T143000Z
DTEND:20160128T153000Z
UID:TALK63070@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:By a "permutation"\, we just mean the elements {1..N} written 
 out in some order.  Suppose we take two of these at random\, and add them 
 together pointwise\, modulo N.  What is the probability that the resulting
  sequence is again a permutation?\n\nThis question has been posed in the l
 iterature under various guises\, and a number of bounds proven or conjectu
 red. In recent work with Sean Eberhard and Rudi Mrazovic\, we compute the 
 answer up to a factor of 1\n+ o(1).\n\nI will outline the proof\, which us
 es Fourier analysis and some methods from analytic combinatorics.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR