加载中…
2025-09-29
The Complexity of Arc-Connectedness Relation in the Plane
Yusuf Uyar
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本