University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Combinatorial discrepancy and harmonic analysis

Combinatorial discrepancy and harmonic analysis

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

If you have a question about this talk, please contact M.Jenssen.

Given a collection of finite subsets A_1,..., A_n of {1,... ,n }, a basic problem in combinatorial discrepancy theory is to find a colouring f of {1,...,n} with {+1,-1} so that the largest sum of f over x in A_i is as small as possible. I will discuss how the sort of combinatorial reasoning used to think about problems in combinatorial discrepancy can help us solve an old problem in the field of harmonic analysis. This talk is based on joint work with Balister, Bollobás, Morris and Tiba.


Meeting ID: 830 2268 5017 Passcode: 101833

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.