# Representing Ordinal Numbers with Arithmetically Interesting Sets of Real Numbers

• D. D. Blair, J. D. Hamkins, and K. O’Bryant, “Representing Ordinal Numbers with Arithmetically Interesting Sets of Real Numbers,” Mathematics arXiv, 2019. (under review)
@ARTICLE{BlairHamkinsOBryant:Representing-ordinal-numbers-with-arithmetically-interesting-sets-of-real-numbers,
author = {D. Dakota Blair and Joel David Hamkins and Kevin O'Bryant},
title = {Representing Ordinal Numbers with Arithmetically Interesting Sets of Real Numbers},
journal = {Mathematics arXiv},
year = {2019},
volume = {},
number = {},
pages = {},
month = {},
note = {under review},
abstract = {},
keywords = {under-review},
source = {},
doi = {},
url = {https://wp.me/p5M0LV-1Tg},
eprint = {1905.13123},
archivePrefix = {arXiv},
primaryClass = {math.NT},
}

Abstract. For a real number $x$ and set of natural numbers $A$, define $x∗A = \{xa \mod 1 \mid a \in A\}\subseteq [0,1)$. We consider relationships between $x$, $A$, and the order-type of $x∗A$. For example, for every irrational $x$ and order-type $\alpha$, there is an $A$ with $x ∗ A \simeq\alpha$, but if $\alpha$ is an ordinal, then $A$ must be a thin set. If, however, $A$ is restricted to be a subset of the powers of $2$, then not every order type is possible, although arbitrarily large countable well orders arise.

# Burak Kaya, Ph.D. March 2016

Burak Kaya successfully defended his dissertation, “Cantor minimal systems from a descriptive perspective,” on March 24, 2016, earning his Ph.D. degree at Rutgers University under the supervision of Simon Thomas. The dissertation committee consisted of Simon Thomas, Gregory Cherlin, Grigor Sargsyan and myself, as the outside member. The defense was very nice, with an extremely clear account of the main results, and the question session included a philosophical discussion on various matters connected with the dissertation, including the principle attributed to Gao that any collection of mathematical structures that has a natural Borel representation has a unique such representation up to Borel isomorphism, a principle that was presented as a Borel-equivalence-relation-theory analogue of the Church-Turing thesis. Abstract.  In recent years, the study of the Borel complexity of naturally occurring classification problems has been a major focus in descriptive set theory. This thesis is a contribution to the project of analyzing the Borel complexity of the topological conjugacy relation on various Cantor minimal systems.

We prove that the topological conjugacy relation on pointed Cantor minimal systems is Borel bireducible with the Borel equivalence relation $\newcommand\d{\Delta^+_{\mathbb{R}}}\d$. As a byproduct of our analysis, we also show that $\d$ is a lower bound for the topological conjugacy relation on Cantor minimal systems.

The other main result of this thesis concerns the topological conjugacy relation on Toeplitz subshifts. We prove that the topological conjugacy relation on Toeplitz subshifts with separated holes is a hyperfinite Borel equivalence relation. This result provides a partial affirmative answer to a question asked by Sabok and Tsankov.

As pointed Cantor minimal systems are represented by properly ordered Bratteli diagrams, we also establish that the Borel complexity of equivalence of properly ordered Bratteli diagrams is $\d$.