Logic Seminar
Patrick Lutz
University of Michigan
Borel graphable equivalence relations
Abstract: In his thesis, Arant introduced and studied the notion of Borel graphability: an equivalence relation E on a Polish space X is Borel graphable if there is a Borel graph on X whose connectivity relation is equal to E. In recent work, Tyler Arant, Alexander Kechris and I have addressed the question of which equivalence relations are Borel graphable. I will discuss some of our results, including on the Borel graphability of equivalence relations generated by Polish group actions, as well as mention some open questions.
Tuesday November 11, 2025 at 3:00 PM in 636 SEO