University of Cambridge > Talks.cam > Combinatorics Seminar > Additive triples of permutations

Additive triples of permutations

Add to your list(s) Download to your calendar using vCal

  • UserFreddie Manners (University of Oxford)
  • ClockThursday 28 January 2016, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

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?

This question has been posed in the literature under various guises, and a number of bounds proven or conjectured. In recent work with Sean Eberhard and Rudi Mrazovic, we compute the answer up to a factor of 1 + o(1).

I will outline the proof, which uses Fourier analysis and some methods from analytic combinatorics.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity