Optimal connectivity results for spheres in the curve graph of low and medium complexity surfaces
Helena Heinonen, Roshan Klein-Seetharaman, Minghan Sun

TL;DR
This paper investigates the connectivity properties of spheres in the curve graph of certain low and medium complexity surfaces, providing new results on their connectedness and component classification.
Contribution
It establishes the connectivity of spheres of any radius in specific surfaces and classifies components of radius 2 spheres in others, answering a question posed by Wright.
Findings
Spheres of any radius are connected in the curve graph of $oldsymbol{ ext{Σ}_{2,0}}$, $oldsymbol{ ext{Σ}_{1,3}}$, and $oldsymbol{ ext{Σ}_{0,6}}$.
Union of two consecutive spheres is connected in $oldsymbol{ ext{Σ}_{0,5}}$ and $oldsymbol{ ext{Σ}_{1,2}}$.
Connected components of radius 2 spheres are classified for $oldsymbol{ ext{Σ}_{0,5}}$ and $oldsymbol{ ext{Σ}_{1,2}}$.
Abstract
Answering a question of Wright, we show that spheres of any radius are always connected in the curve graph of surfaces and , and the union of two consecutive spheres is always connected for and . We also classify the connected components of spheres of radius 2 in the curve graph of and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraphene and Nanomaterials Applications · Topological and Geometric Data Analysis · Digital Image Processing Techniques
