BEGIN:VCALENDAR
PRODID:-//Columba Systems Ltd//NONSGML CPNG/SpringViewer/ICal Output/3.3-
 M3//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20240409T095427Z
DTSTART:20240415T130000Z
DTEND:20240415T140000Z
SUMMARY:Dynamical Systems and Analysis Seminar - Chris Lutsko
UID:{http://www.columbasystems.com/customers/uom/gpp/eventid/}a2qe-ls09lw
 17-frp952
DESCRIPTION:Speaker: Chris Lutsko (University of Zurich)\n\nTitle: Hyperb
 olic lattice point counting in unbounded rank\n\nAbstract: Counting latt
 ice points in balls is a classical problem which goes back to Gauss in t
 he Euclidean setting. In the hyperbolic setting this corresponds to coun
 ting matrices of norm T in SL(n\,Z). For n=2 the record belongs to Selbe
 rg in the early 1980s. In a recent paper with Valentin Blomer we extend 
 Selberg's method to higher rank (n > 2) and thus improve on the best kno
 wn bounds for the hyperbolic lattice point counting problem in higher ra
 nk. In the first half of this talk I will introduce the problem\, summar
 ize the history\, and give a sketch of Selberg's method. Then in whateve
 r time remains\, I will give a sketch of the proof of Blomer and myself.
 \n\nRoom: Frank Adams 1\n\nFurther information: https://personalpages.ma
 nchester.ac.uk/staff/yotam.smilansky/dynamics_analysis
STATUS:TENTATIVE
TRANSP:TRANSPARENT
CLASS:PUBLIC
LOCATION:Frank Adams 1\, Alan Turing Building\, Manchester
END:VEVENT
END:VCALENDAR