Counting problems on a random lattice

Abstract: A random lattice is a random element of SL(n,Z) \ SL(n,R) equipped with the probability measure inherited from the Haar measure of SL(n,R). Analogous to the usual lattice point-counting, one tries to “count” — more precisely, study the statistics of — the random lattice points inside a ball or other shapes. I’ll give a gentle introduction to this topic, discussing the early works of Siegel, Rogers and Schmidt and some of the recent results, as well as their applications.

dynamical systemsnumber theory

Audience: general audience

New England Dynamics and Number Theory Seminar