A llison Y. W ang . Complexity in Countable Borel Equivalence Relations and Topological Ramsey Spaces . Carnegie Mellon University. 2026. Supervised by Clinton T. Conley. MSC: 03E15, 54H05, 28A05.

This dissertation investigates several questions concerning complexity in the context of countable Borel equivalence relations (CBERs) and topological Ramsey spaces. Chapter 2 presents relevant background material about topological Ramsey spaces. Also discussed are several examples of such spaces, including the Milliken space of strong subtrees and the Carlson–Simpson space of infinite partitions of ω $\omega $ omega . Chapter 3, which is joint work with Aristotelis Panagiotopoulos, studies CBERs on the Carlson–Simpson space. Ramsey-theoretic methods cannot distinguish CBERs beyond hyperfiniteness. More specifically, Mathias showed that every CBER on [ ω ] ω $[\omega ]^\omega $ left bracket omega right bracket Superscript omega is hyperfinite on a non-empty Ellentuck cube, and Bursics and Vidnyánszky recently extended this result to all topological Ramsey spaces. An even stronger result holds in some topological Ramsey spaces. For example, Kanovei, Sabok, and Zapletal showed that every CBER on the Milliken space of strong subtrees of 2 < ω $2^{<\omega }$ 2 Superscript less than omega is smooth on a non-empty Ellentuck cube; in fact, the same holds true for any analytic equivalence relation on this space. The main result of this chapter is that every CBER on the Carlson–Simpson space is smooth on a non-empty Ellentuck cube, but that this statement fails for arbitrary analytic equivalence relations. Chapter 4 examines the complexity of a set arising naturally from notions in topological Ramsey theory. Sabok proved that the set of codes for the G δ $G_\delta $ upper G Subscript delta Ramsey positive sets in [ ω ] ω $[\omega ]^\omega $ left bracket omega right bracket Superscript omega is Σ 2 1 $\Sigma ^1_2$ normal upper Sigma 2 Superscript 1 -complete, and that the same holds for analytic Ramsey positive sets. A natural question is whether the same results hold in other topological Ramsey spaces. In this chapter, it is shown that the analogous sets of codes in other topological Ramsey spaces are Σ 2 1

Publication Details

Journal
Bulletin of Symbolic Logic
Published
2026-11-05
DOI
https://doi.org/10.1017/bsl.2026.10170
Primary Topic
Advanced Topology and Set Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A llison Y. W ang . Complexity in Countable Borel Equivalence Relations and Topological Ramsey Spaces . Carnegie Mellon University. 2026. Supervised by Clinton T. Conley. MSC: 03E15, 54H05, 28A05.

Bulletin of Symbolic Logic
Advanced Topology and Set Theory
article

A llison Y. W ang . Complexity in Countable Borel Equivalence Relations and Topological Ramsey Spaces . Carnegie Mellon University. 2026. Supervised by Clinton T. Conley. MSC: 03E15, 54H05, 28A05.

article en

Abstract

This dissertation investigates several questions concerning complexity in the context of countable Borel equivalence relations (CBERs) and topological Ramsey spaces. Chapter 2 presents relevant background material about topological Ramsey spaces. Also discussed are several examples of such spaces, including the Milliken space of strong subtrees and the Carlson–Simpson space of infinite partitions of ω $\omega $ omega . Chapter 3, which is joint work with Aristotelis Panagiotopoulos, studies CBERs on the Carlson–Simpson space. Ramsey-theoretic methods cannot distinguish CBERs beyond hyperfiniteness. More specifically, Mathias showed that every CBER on [ ω ] ω $[\omega ]^\omega $ left bracket omega right bracket Superscript omega is hyperfinite on a non-empty Ellentuck cube, and Bursics and Vidnyánszky recently extended this result to all topological Ramsey spaces. An even stronger result holds in some topological Ramsey spaces. For example, Kanovei, Sabok, and Zapletal showed that every CBER on the Milliken space of strong subtrees of 2 < ω $2^{<\omega }$ 2 Superscript less than omega is smooth on a non-empty Ellentuck cube; in fact, the same holds true for any analytic equivalence relation on this space. The main result of this chapter is that every CBER on the Carlson–Simpson space is smooth on a non-empty Ellentuck cube, but that this statement fails for arbitrary analytic equivalence relations. Chapter 4 examines the complexity of a set arising naturally from notions in topological Ramsey theory. Sabok proved that the set of codes for the G δ $G_\delta $ upper G Subscript delta Ramsey positive sets in [ ω ] ω $[\omega ]^\omega $ left bracket omega right bracket Superscript omega is Σ 2 1 $\Sigma ^1_2$ normal upper Sigma 2 Superscript 1 -complete, and that the same holds for analytic Ramsey positive sets. A natural question is whether the same results hold in other topological Ramsey spaces. In this chapter, it is shown that the analogous sets of codes in other topological Ramsey spaces are Σ 2 1

Bulletin of Symbolic Logic
Openalex Percentile: Top 10%
Advanced Topology and Set Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
A llison Y. W ang . Complexity in Countable Borel Equivalence Relations and Topological Ramsey Spaces . Carnegie Mellon University. 2026. Supervised by Clinton T. Conley. MSC: 03E15, 54H05, 28A05. · Bulletin of Symbolic Logic (2026) | TGRS Research Map | TGRS