Lattice points in disks and strongly convex domains

This thesis examines the history and some major results of the Gauss Circle Problem. The goal of the Gauss Circle Problem is to determine the best bound for the error between the number of lattice points inside a disk and that disks area, otherwise known as the lattice point discrepancy. First we state some of the required definitions and properties from Fourier analysis that will be used throughout. In particular, we establish asymptotic results for oscillatory integrals and more specifically for Bessel functions. After examining the geometrical method for precisely counting the number of lattice points inside a disk of radius R, we use the Poisson Summation Formula and the Bessel function results to prove initial bounds on the lattice point discrepancy. We present two such results, employing a similar technique for both, and then apply oscillatory integral asymptotics to extend this method and establish a lattice point discrepancy result for strongly convex domains.

Name thesis:degree_name

Mathematics

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Mathematics & Statistics

Year

2013

Author dc:creator

• Brooks, Dusty

Contributors dc:contributor

• Blair, Matthew D.
• Matthew D. Blair
• Michael Nakamaye
• Maria Cristina Pereyra

• Lattice theory
• Convex domains
• Fourier analysis
• Bessel functions.

Language dc:language

English

Identifier

https://digitalrepository.unm.edu/math_etds/5

OAI identifier oai:identifier

oai:digitalrepository.unm.edu:math_etds-1004