Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2405.03539

Connecting essential triangulations I: via 2-3 and 0-2 moves

Tejas Kalelkar·Saul Schleimer·Henry Segerman
View original source ↗Read source document ↗Export metadata ↓

Abstract

Suppose that $M$ is a compact, connected three-manifold with boundary. We show that if the universal cover has infinitely many boundary components then $M$ has an ideal triangulation which is essential: no edge can be homotoped into the boundary. Under the same hypotheses, we show that the set of essential triangulations of $M$ is connected via 2-3, 3-2, 0-2, and 2-0 moves. The above results are special cases of our general theory. We introduce $L$-essential triangulations: boundary components of the universal cover receive labels and no edge has the same label at both ends. As an application, under mild conditions on a representation, we construct an ideal triangulation for which a solution to Thurston's gluing equations recovers the given representation. Our results also imply that such triangulations are connected via 2-3, 3-2, 0-2, and 2-0 moves. Together with results of Pandey and Wong, this proves that Dimofte and Garoufalidis' 1-loop invariant is independent of the choice of essential triangulation.

Explore related subjects

math.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tejas Kalelkar, Saul Schleimer, Henry Segerman. 2024-05-06. Connecting essential triangulations I: via 2-3 and 0-2 moves. https://arxiv.org/abs/2405.03539

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗