WorksMathematics
Borel combinatorics of -shift actions and hypersmooth equivalence relations
Abstract
We conjecture that for each integer , the equivalence relation arising from the shift action of on is hypersmooth. We prove this conjecture for , reduce the general case to a problem in Borel graph colorings, and establish the general case in measure. We also show that under certain mild hypotheses on a hypersmooth equivalence relation , every finite-index Borel super-equivalence relation of is hypersmooth.