Réunion d'hiver SMC 2024

Vancouver/Richmond, 29 novembre - 2 decembre 2024

       
Descriptive Set Theory, Continuous Logic, and Applications
Org: Christopher Eagle (UVic), Marcin Sabok (McGill) et Assaf Shani (Concordia)
ANTOINE POULIN, McGill
Borel quasi-trees are treeable  [PDF]

In this talk, we consider countable Borel equivalence relations structured (in the sense of Chen-Kechris) by quasi-trees, that is graph quasi-isometric to trees. Using the Isbel-Werner duality between median graphs and (a class of) poset with complements, we show that all such equivalence relations are treeable.

© Société mathématique du Canada : http://www.smc.math.ca/