University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Exploiting structure in sets of frequencies

## Exploiting structure in sets of frequenciesAdd to your list(s) Download to your calendar using vCal - Thomas Bloom (University of Bristol)
- Tuesday 14 November 2017, 15:00-16:00
- Watson LTA.
If you have a question about this talk, please contact Guillem Perarnau. Many problems in additive combinatorics and theoretical computer science are amenable to techniques of Fourier analysis, which is a powerful way of quantifying the well-known dichotomy between structure and randomness. In particular, if a set of integers does not behave pseudorandomly then it has many large Fourier coefficients. In the past few years there have been many developments achieved by treating this set of large Fourier coefficients as a subset of an abelian group and applying physical combinatorial arguments to extract more useful information. I will discuss these ideas and their applications to several problems in additive combinatorics. This talk is part of the Combinatorics and Probability seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsFacts and Snacks BritGrav 15 Mathematics Colloquium## Other talksTBC Horizontal Mean Curvature Flow and stochastic optimal controls Quantum Sensing in Space TBA Control variates for computing transport coefficients Hunt for an Earth-twin |