640 research outputs found
Uniformity, Universality, and Computability Theory
We prove a number of results motivated by global questions of uniformity in
computability theory, and universality of countable Borel equivalence
relations. Our main technical tool is a game for constructing functions on free
products of countable groups.
We begin by investigating the notion of uniform universality, first proposed
by Montalb\'an, Reimann and Slaman. This notion is a strengthened form of a
countable Borel equivalence relation being universal, which we conjecture is
equivalent to the usual notion. With this additional uniformity hypothesis, we
can answer many questions concerning how countable groups, probability
measures, the subset relation, and increasing unions interact with
universality. For many natural classes of countable Borel equivalence
relations, we can also classify exactly which are uniformly universal.
We also show the existence of refinements of Martin's ultrafilter on Turing
invariant Borel sets to the invariant Borel sets of equivalence relations that
are much finer than Turing equivalence. For example, we construct such an
ultrafilter for the orbit equivalence relation of the shift action of the free
group on countably many generators. These ultrafilters imply a number of
structural properties for these equivalence relations.Comment: 61 Page
Borel circle squaring
We give a completely constructive solution to Tarski's circle squaring
problem. More generally, we prove a Borel version of an equidecomposition
theorem due to Laczkovich. If and are
bounded Borel sets with the same positive Lebesgue measure whose boundaries
have upper Minkowski dimension less than , then and are
equidecomposable by translations using Borel pieces. This answers a question of
Wagon. Our proof uses ideas from the study of flows in graphs, and a recent
result of Gao, Jackson, Krohne, and Seward on special types of witnesses to the
hyperfiniteness of free Borel actions of .Comment: Minor typos correcte
Measurable realizations of abstract systems of congruences
An abstract system of congruences describes a way of partitioning a space
into finitely many pieces satisfying certain congruence relations. Examples of
abstract systems of congruences include paradoxical decompositions and
-divisibility of actions. We consider the general question of when there are
realizations of abstract systems of congruences satisfying various
measurability constraints. We completely characterize which abstract systems of
congruences can be realized by nonmeager Baire measurable pieces of the sphere
under the action of rotations on the -sphere. This answers a question of
Wagon. We also construct Borel realizations of abstract systems of congruences
for the action of on .
The combinatorial underpinnings of our proof are certain types of decomposition
of Borel graphs into paths. We also use these decompositions to obtain some
results about measurable unfriendly colorings.Comment: minor correction
- β¦