Search arXivSearch

arXiv · 0904.1893

A generalisation of the deformation variety

Abstract

Given an ideal triangulation of a connected 3-manifold with non-empty boundary consisting of a disjoint union of tori, a point of the deformation variety is an assignment of complex numbers to the dihedral angles of the tetrahedra subject to Thurston's gluing equations. From this, one can recover a representation of the fundamental group of the manifold into the isometries of 3-dimensional hyperbolic space. However, the deformation variety depends crucially on the triangulation: there may be entire components of the representation variety which can be obtained from the deformation variety with one triangulation but not another. We introduce a generalisation of the deformation variety, which again consists of assignments of complex variables to certain dihedral angles subject to polynomial equations, but together with some extra combinatorial data concerning degenerate tetrahedra. This "extended deformation variety" deals with many situations that the deformation variety cannot. In particular we show that for any ideal triangulation of a small orientable 3-manifold with a single torus boundary component, we can recover all of the irreducible non-dihedral representations from the associated extended deformation variety. More generally, we give an algorithm to produce a triangulation of a given orientable 3-manifold with torus boundary components for which the same result holds. As an application, we show that this extended deformation variety detects all factors of the PSL(2,C) A-polynomial associated to the components consisting of the representations it recovers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Henry Segerman. 2012-06-18. A generalisation of the deformation variety. https://doi.org/10.2140/agt.2012.12.2179

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