Previous Conferences & Workshops

We investigate the Bilinear Hilbert Transform in the plane and the pointwise convergence of bilinear averages in Ergodic theory, arising from Z^2 actions. Our techniques combine novel one and a half dimensional phase-space analysis with more...

A 3-uniform hypergraph is hamiltonian if for some cyclic ordering of its vertex set, every 3 consecutive vertices form an edge. In 1952 Dirac proved that if the minimum degree in an n-vertex graph is at least n/2 then the graph is hamiltonian. We...

Recently, algebraic codes which achieve the optimal trade-off between rate and (list) error-correction radius were constructed by a careful "folding" of the Reed-Solomon code. The "low-degree'' nature of this folding operation was crucial to the...