BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260601T123707EDT-7869pR8vGP@132.216.98.100
DTSTAMP:20260601T163707Z
DESCRIPTION:Title: Quasi-treeable CBERs are treeable via median graphs\n\nA
 bstract: A countable Borel equivalence relation (CBER) E on a Polish space
  X is said to be treeable if there is a Borel forest G ⊂ X2 whose trees ar
 e precisely the equivalence classes of said relation. E is quasi-treeable 
 if it has a Borel graphing\, each of whose components is quasi-isometric t
 o a tree.\n\nIn joint work with Ruiyuan (Ronnie) Chen\, Antoine Poulin and
  Anush Tserunyan\, we show that quasi-treeable CBERs are treeable by givin
 g a construction of a median graph associated to the quasi-treeing\, which
  will be the main focus of this talk.\n
DTSTART:20231018T190000Z
DTEND:20231018T200000Z
LOCATION:Room 920\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY:Ran Tao (Carnegie Mellon University)
URL:/mathstat/channels/event/ran-tao-carnegie-mellon-u
 niversity-352100
END:VEVENT
END:VCALENDAR