Strong treeability of planar groups

11.06.2015 15:00 - 16:30

C. Conley (Cornell U, New York, US)

An equivalence relation is called treeable if it can be realized as the connectedness relation of an acyclic Borel graph. We call a finitely generated group planar if there is some finite generating set such that the induced Cayley graph of the group is planar. Using techniques originally created to analyze measure-theoretic chromatic numbers of graphs, we show that any orbit equivalence relation of a free measure-preserving action of a planar group on a standard probability space is treeable on a conull set.

This is joint work with Gaboriau, Marks, and Tucker-Drob.

Organiser:

KGRC

Location:
SR 101, 2. St., Währinger Str. 25