zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Higher order Fourier analysis. (English) Zbl 1277.11010
Graduate Studies in Mathematics 142. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-8986-2/hbk). x, 187 p. $ 54.00 (2012).

The theory of higher order Fourier analysis is very recent, and the present book is a very good introduction to this nascent field. Whereas classical Fourier analysis uses the sequence of functions ne 2πiαn , quadratic Fourier analysis uses functions of the form ne 2πiαn 2 , and so forth for higher order Fourier analysis. Higher order Fourier analysis has many applications, in areas that include combinatorics, ergodic theory, theoretical computer science and for finding asymptotics for various linear patterns in the growth of prime numbers. The famous precursors of the theory include Weyl, in his study of equidistribution, and Furstenberg, in his structural theory of dynamical systems. The modern theory started at the end of the 1990s in the work of Gowers.

The book is divided into two chapters. The first chapter constitutes a basic introduction to the subject, and it can be used as text for a graduate or post-graduate course. The sections in that chapter include the equidistribution theory in tori, Roth’s theorem, linear patterns, equidistribution in finite fields, the inverse conjecture over finite fields, the inverse conjecture over the integers, and linear equations in primes. The second chapter contains more specialized material, and it contains sections on ultralimit analysis, higher order Hilbert spaces and the uncertainty principle.

Although it is difficult to read, in part because the subject matter and the methods are new, the book is very well written and it should serve as a useful and good introduction to the research papers on the subject.

11B30Arithmetic combinatorics; higher degree uniformity
11-02Research monographs (number theory)
11L07Estimates on exponential sums
11U07Ultraproducts in number theory
37A45Relations of ergodic theory with number theory and harmonic analysis