BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20250706T104031EDT-027943R56n@132.216.98.100
DTSTAMP:20250706T144031Z
DESCRIPTION:Title: On loops intersecting at most once.\n\nAbstract: How man
 y simple closed curves can you draw on the closed surface of genus g in su
 ch a way that no two are isotopic and no two intersect in more than k poin
 ts? It is known how to draw a collection in which the number of curves gro
 ws as a polynomial in g of degree k+1\, and conjecturally\, this is best p
 ossible. I will describe a proof of an upper bound that matches this funct
 ion up to a factor of log g. It is based on an elegant geometric argument 
 due to Przytycki and employs some novel ideas blending covering spaces and
  probabilistic combinatorics.\n
DTSTART:20190403T190000Z
DTEND:20190403T200000Z
LOCATION:Room 920\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY:Joshua Greene (Boston College)
URL:/mathstat/channels/event/joshua-greene-boston-coll
 ege-295785
END:VEVENT
END:VCALENDAR