I will survey recent results in the theory of measure equivalence between locally compact groups and discuss some directions of future research.
For linear orders \(A\) and \(B\), their ordered sum \(A + B\) is obtained by placing a copy of \(B\) to the right of \(A\). This operation is non-commutative in general, so one might ask: which pairs of linear orders do additively commute? That is, for which linear orders \(A\) and \(B\) do we have \(A + B \cong B + A\)?
Tarski studied this question seriously at various times in his career from the 1920s through the 1950s. In this talk, I'll discuss recent work with Eric Paul in which we use a novel Euclidean algorithm for pairs of linear orders that "almost" additively commute to solve two problems posed by Tarski in 1956. Along the way, I'll draw connections between the classical combinatorial perspective for studying sums of linear orders and a more modern perspective that translates such questions into the language of generalized interval exchange transformations.
TBA
A major open problem in descriptive set theory asks whether amenability of a countable Borel equivalence relation implies a stronger finite approximation property known as hyperfiniteness. Although open in general, there have been many recent advances in important cases, producing techniques which have proven to be fruitful in all sorts of other situations. One of the landmark results is due to Gao and Jackson, who showed that every orbit equivalence relation of a countable abelian group is hyperfinite. An orthogonal result due to Dougherty, Jackson and Kechris shows hyperfiniteness for every countable Borel equivalence generated by a single function, i.e. an action of the additive monoid of natural numbers. We prove a common generalization of these results, namely that the orbit equivalence relation of a bounded-to-one action of a commutative monoid is hyperfinite, where an action is said to be bounded-to-one if each function has a uniform finite bound on the size of its fibers. The argument goes through Borel asymptotic dimension, a tool introduced by Conley, Jackson, Marks, Seward and Tucker-Drob to prove hyperfiniteness. This is joint work with Felix Weilacher and Jing Yu.
In 2004, I conjectured that the quasi-isometry problem for finitely generated groups was strictly harder than the isomorphism problem; but unfortunately I was only able to prove that the quasi-isometry problem was not smooth. In this talk, making essential use of techniques developed by Harvey Friedman and Robin Tucker-Drob, I will show that the quasi-isometry problem does not Borel reduce to an essentially free countable Borel equivalence relation.