BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Seungki Kim (University of Cincinnati)
DTSTART:20210510T161500Z
DTEND:20210510T173000Z
DTSTAMP:20260423T021928Z
UID:NEDNT/26
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/NEDNT/26/">C
 ounting problems on a random lattice</a>\nby Seungki Kim (University of Ci
 ncinnati) as part of New England Dynamics and Number Theory Seminar\n\nLec
 ture held in Online.\n\nAbstract\nA 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-countin
 g\, 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 app
 lications.\n
LOCATION:https://researchseminars.org/talk/NEDNT/26/
END:VEVENT
END:VCALENDAR