Published on *Department of Mathematics* (https://math.yale.edu)

February 7, 2019 - 4:00pm

DL 431

The discrepancy of a red-blue vertex coloring of a hypergraph is the maximum imbalance between the number of red and blue vertices in any edge. The discrepancy of a hypergraph is the least discrepancy of any red-blue coloring. A major open problem is the Beck-FĂala conjecture, which asserts that the discrepancy of every t-regular hypergraph is $\mathcal{O}(\sqrt{t})$. I will discuss some recent joint work with Michael Saks on an application of Fourier analysis to the discrepancy of random regular hypergraphs.