Search arXivSearch

arXiv · 2207.06386

Efficient geodesics in the curve complex and their dot graphs

Abstract

For the complex of curves of a closed orientable surface of genus $g$, $\mathcal{C}(S_{g>1})$, the notion of efficient geodesic in was introduced in arXiv:1408.4133. There it was established that there always exists (finitely many) efficient geodesics between any two vertices, $ v_α , v_β \in \mathcal{C}(S_g)$, representing homotopy classes of simple closed curves, $α, β\subset S_g$. The main tool for used in establishing the existence of efficient geodesic was a dot graph, a booking scheme for recording the intersection pattern of a reference arc, $γ\subset S_g$, with the simple closed curves associated with the vertices of geodesic path in the zero skeleton, $\mathcal{C}^0(S_g)$. In particular, for an efficient geodesic between $v_α$ and $v_β$ of length $d \geq 3$, it was shown that any curve corresponding to the vertex that is distance one from $v_α$ intersects any $γ$ at most $d -2$ times. In this note we make a more expansive study of the characterizing "shape" of the dot graphs over the entire set of vertices in an efficient geodesic edge-path. The key take away of this study is that the shape of a dot graph for any efficient geodesic is contained within a spindle shape region. Since the Nielson-Thurston coordinates of any curve on $S_g$ are directly derived from its intersection number with finitely many reference arcs, spindle shaped dot graphs control the coordinate behavior of curves associated with the vertices of an efficient geodesic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hong Chang. 2022-07-13. Efficient geodesics in the curve complex and their dot graphs. https://arxiv.org/abs/2207.06386

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT