Randomness in Diophantine approximation
Location: MSRI: Simons Auditorium
counting points on a lattice
central limit theorem
We discuss the problem of counting solutions of Diophantine inequalities. While a general asymptotic formula for the counting function has been established by W. Schmidt, finer statistical properties of this function are still not well understood. We investigate its limiting distribution and establish the central limit theorem in this context. This is a joint work with Anish Ghosh.
Please report video problems to email@example.com.
See more of our Streaming videos on our main VMath Videos page.