COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Additive triples of permutationsAdd to your list(s) Download to your calendar using vCal - Freddie Manners (University of Oxford)
- Thursday 28 January 2016, 14:30-15:30
- MR12.
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. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
Note that ex-directory lists are not shown. |
## Other listsNonlinear Waves The obesity epidemic: Discussing the global health crisis CamBridgeSens## Other talksRecent advances in understanding climate, glacier and river dynamics in high mountain Asia Cambridge-Lausanne Workshop 2018 - Day 1 Diversity of the human response to malaria Recent developments and debates in East Asian monsoon palaeoclimatology Analysis of Spatio-temporal Representations for Robust Footstep Recognition with Deep Residual Neural Networks Solving the Reproducibility Crisis |