Combinatorial discrepancy and a problem of J.E. Littlewood on Flat Polynomials

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

• Julian Sahasrabudhe (University of Cambridge+
• Thursday 12 March 2020, 15:00-16:00
• Watson LTC.

If you have a question about this talk, please contact Richard Montgomery.

Given a collection of sets A1,...,Am ⊆ [n], the basic problem in combinatorial discrepancy theory is to find a colouring of {1,...,n} with {+1,-1} so that, for each i ∈ [m], the sum of f over the elements A_i is as small in absolute value as possible. In this talk, I will discuss how the sort of combinatorial and probabilistic reasoning used to think about problems in combinatorial discrepancy can be adapted to solve an old conjecture of J.E. Littlewood in harmonic analysis.

This talk is part of the Combinatorics and Probability seminar series.

This talk is included in these lists:

• Combinatorics and Probability seminar
• School of Mathematics events
• Watson LTC

Note that ex-directory lists are not shown.