Sums of squares – characterization and distribution

We survey some of the important and classical facts concerning integers that can be written as the sum of (two, three, or four) squares, as well as the number of such representations, emphasizing the connection to multiplicative functions. We include sketches of proofs of the characterizations of such integers and of Landau’s theorem on the number of integers that can be represented as the sum of two squares. Finally, we discuss the distribution of such integers in short intervals (including a brief description of sieve methods) and speculate on related questions involving lattice points in thin regions of the plane.

Séries:
Microsoft Research Talks
Date:
Haut-parleurs:
Greg Martin
Affiliation:
University of British Columbia

Taille: Microsoft Research Talks