Pierre Bienvenu received his training in mathematics at the Ecole Normale Supérieure, and is now preparing a PhD at the University of Bristol. In his first two years in the PhD program, he has been working in the domain of arithmetic combinatorics, trying to estimate the frequency of occurrences of various patterns in the set of prime numbers. One of the guiding principles is that the set of primes is in some sense pseudorandom – that is, it looks a lot like a randomly generated sparse set. He has written and submitted two papers in this domain.
- Pseudorandomness, Spring 2017. Visiting Graduate Student.