BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260510T051757EDT-3202Eiawlo@132.216.98.100
DTSTAMP:20260510T091757Z
DESCRIPTION:Title: Borel graphings of analytic equivalence relations.\n\nAb
 stract: Every Borel graph has a connectedness equivalence relation which i
 s (at worst) analytic. In this talk\, we explore the other direction: whic
 h analytic equivalence relations are the connectedness equivalence relatio
 ns of Borel graphs\, i.e.\, which analytic equivalence relations are Borel
  graphable? The talk will present interesting examples and non-examples of
  Borel graphable equivalence relations\; indeed\, these examples come from
  many areas: model theory (isomorphism of countable structures)\, computab
 ility theory (countable admissible ordinals)\, and Borel group actions. We
  will also discuss some results and open problems about the possible diame
 ters (the least  such that all connected nodes have a path of length  conn
 ecting them) of Borel graphings. This work is joint with Alekos Kechris an
 d Patrick Lutz\n
DTSTART:20260210T163000Z
DTEND:20260210T173000Z
LOCATION:Room 920\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY: Tyler Arant (UCLA)
URL:https://www.mcgill.ca/mathstat/channels/event/tyler-arant-ucla-371113
END:VEVENT
END:VCALENDAR