Dubi Kelmer
Boston College
November 5, 2015
Counting lattice points in a random lattice: The problem of counting lattice points in growing domains has a long history and is related to many problems raging from number theory, ergodic theory, and mathematical physics. The main term is usually given by the volume of the domain and it is a hard problem to find the best bounds for the remainder. In my talk I will describe some classical results related to this problem, and present some new results giving optimal bounds for the remainder that hold on average in the space of lattices.
Boston College
November 5, 2015
Counting lattice points in a random lattice: The problem of counting lattice points in growing domains has a long history and is related to many problems raging from number theory, ergodic theory, and mathematical physics. The main term is usually given by the volume of the domain and it is a hard problem to find the best bounds for the remainder. In my talk I will describe some classical results related to this problem, and present some new results giving optimal bounds for the remainder that hold on average in the space of lattices.