What's it about?
Higher-order Fourier analysis is an extension of classic Fourier analysis, where one extends the notion of characters to low-degree polynomial phases. This study originated in number theory in the seminal work of Gowers on Szemeredi's theorem and has been extensively developed in the last few years.
Recently, there have been several striking applications of the theory to computer science, which are the focus of this workshop. These include: explicit constructions of functions having low correlation with polynomials, learning structural decompositions of low degree polynomials, list-decoding of Reed-Muller codes, and a unified framework for testing of algebraic properties.
Who is it for?
The workshop is intended for a general TCS audience, and no familiarity with past work in this area is needed.
When and where is it?
How do I sign up?
Please register at the main FOCS registration site.