Publisher's Synopsis
Higher-order Fourier Analysis and Applications provides an introduction to the field of higher-order Fourier analysis with an emphasis on its applications to theoretical computer science. Higher-order Fourier analysis is an extension of the classical Fourier analysis. It has been developed by several mathematicians over the past few decades in order to study problems in an area of mathematics called additive combinatorics, which is primarily concerned with linear patterns such as arithmetic progressions in subsets of integers. The monograph is divided into three parts: Part I discusses linearity testing and its generalization to higher degree polynomials. Part II present the fundamental results of the theory of higher-order Fourier analysis. Part III uses the tools developed in Part II to prove some general results about property testing for algebraic properties. It describes applications of the theory of higher-order Fourier analysis in theoretical computer science, and, to this end, presents the foundations of this theory through such applications; in particular to the area of property testing.
