×Time: 14:15 on 6 Oct, 2016
Place: Speigelgasse 5, 05.001
Martin Widmer (Royal Holloway)
Weakly admissible lattices, o-minimality, and Diophantine approximation
We present new estimates for the number of lattice points in sets such as aligned boxes which, in certain cases, improveon Skriganov's celebrated counting results. We establish a criterion under which our error term is sharp, and we provideexamples in dimensions $2$ and $3$ using continued fractions. Moreover, we use o-minimality to describe large classes ofsets to which our counting results apply.If time permits we also present a similar counting result for primitive lattice points, and apply the latterto the classical problem of Diophantine approximation with primitive points as studied by Chalk, Erd\H{o}s and others.