The Complexity of Arc-Connectedness Relation in the Plane

2025/09/29 by Uyar, Yusuf · 1 citation
#FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.2509.24596

Abstract

In this paper, we show that the arc-connectedness equivalence relation on a Polish subspace of the real plane is an essentially hyperfinite Borel equivalence relation. This result provides the optimal upper bound for such a Borel equivalence relation.

Cited by

• Fundamental groups and descriptive set theory

Related

• A nonsmooth path-connectedness relation in the real plane
• On the complexity of Borel equivalence relations with some countability property
• n-Arc Connected Spaces
• Hyper-hyperfiniteness and complexity
• Strong Arcwise Connectedness