Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 144 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 28 tok/s Pro
GPT-4o 124 tok/s Pro
Kimi K2 210 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Separation of plane sets by equidistant simple closed curves (2403.20166v1)

Published 29 Mar 2024 in math.GN and math.GT

Abstract: We prove that if two subsets ${A}$ and ${B}$ of the plane are connected, ${A}$ is bounded, and the Euclidean distance $\rho({A},{B})$ between ${A}$ and ${B}$ is greater than zero, then for every positive $\varepsilon<\rho({A},{B})$, the sets ${A}$ and ${B}$ can be separated by a simple closed curve (also known as a Jordan curve) whose points all lie at distance $\varepsilon$ from the set ${A}$. We also prove that the $\varepsilon$-boundary of a connected bounded subset ${A}$ of the plane contains a simple closed curve bounding the domain containing the open $\varepsilon$-neighbourhood of ${A}$. It is shown that in both statements the connectivity condition can be significantly weakened. We also show that the $\varepsilon$-boundary of a nonempty bounded subset of the plane contains a simple closed curve. This result complements Morton Brown's statement that the $\varepsilon$-boundary of a nonempty compact subset of the plane is contained in the union of a finite number of simple closed curves.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.