Search arXivSearch

arXiv · 1312.0913

Minimally intersecting filling pairs on surfaces

Abstract

Let $S_{g}$ denote the closed orientable surface of genus $g$. We construct exponentially many mapping class group orbits of pairs of simple closed curves which fill $S_{g}$ and intersect minimally, by showing that such orbits are in correspondence with the solutions of a certain permutation equation in the symmetric group. Next, we demonstrate that minimally intersecting filling pairs are combinatorially optimal, in the sense that there are many simple closed curves intersecting the pair exactly once. We conclude by initiating the study of a topological Morse function $\mathcal{F}_{g}$ over the Moduli space of Riemann surfaces of genus $g$, which, given a hyperbolic metric $σ$, outputs the length of the shortest, minimally intersecting filling pair for the metric $σ$. We completely characterize the global minima of $\mathcal{F}_{g}$, and using the exponentially many mapping class group orbits of minimally intersecting filling pairs that we construct in the first portion of the paper, we show that the number of such minima grow at least exponentially in $g$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tarik Aougab, Shinnyih Huang. 2013-12-04. Minimally intersecting filling pairs on surfaces. https://doi.org/10.2140/agt.2015.15.903

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