Geometric Discrepancy Theory Anduniform Distribution

Abstract

A sequence s1, s2, . . . in U = [0, 1) is said to be uniformly distributed if, in the limit, the number of sj falling in any given subinterval is proportional to its length. Equivalently, s1, s2, . . . is uniformly distributed if the sequence of equiweighted atomic probability measures μN (sj) = 1/N , supported by the initial N -segments s1, s2, . . . , sN , converges weakly to Lebesgue measure on U. This notion immediately generalizes to any topological space with a corresponding probability measure on the Borel sets. Uniform distribution, as an area of study, originated from the remarkable paper of Weyl [Wey16], in which he established the fundamental result known nowadays as the Weyl criterion (see [Cas57, KN74]). This reduces a problem on uniform distribution to a study of related exponential sums, and provides a deeper understanding of certain aspects of Diophantine approximation, especially basic results such as Kronecker’s density theorem. Indeed, careful analysis of the exponential sums that arise often leads to Erdős-Turán type upper bounds, which in turn lead to quantitative statements concerning uniform distribution. Today, the concept of uniform distribution has important applications in a number of branches of mathematics such as number theory (especially Diophantine approximation), combinatorics, ergodic theory, discrete geometry, statistics, numerical analysis, etc. In this chapter, we focus on the geometric aspects of the theory.