Experimental Mathematics

Hyperbolic Graphs of Small Complexity

Damian Heard, Craig Hodgson, Bruno Martelli, and Carlo Petronio

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

In this paper we enumerate and classify the "simplest'' pairs $(M,G)$, where $M$ is a closed orientable $3$-manifold and $G$ is a trivalent graph embedded in $M$.

To enumerate the pairs we use a variation of Matveev's definition of complexity for $3$-manifolds, and we consider only $(0,1,2)$-irreducible pairs, namely pairs $(M,G)$ such that any $2$-sphere in $M$ intersecting $G$ transversely in at most two points bounds a ball in $M$ either disjoint from $G$ or intersecting $G$ in an unknotted arc. To classify the pairs, our main tools are geometric invariants defined using hyperbolic geometry. In most cases, the graph complement admits a unique hyperbolic structure with parabolic meridians; this structure was computed and studied using Heard's program "Orb" and Goodman's program "Snap".

We determine all $(0,1,2)$-irreducible pairs up to complexity $5$, allowing disconnected graphs but forbidding components without vertices in complexity $5$. The result is a list of $129$ pairs, of which $123$ are hyperbolic with parabolic meridians. For these pairs we give detailed information on hyperbolic invariants including volumes, symmetry groups, and arithmetic invariants. Pictures of all hyperbolic graphs up to complexity $4$ are provided. We also include a partial analysis of knots and links.

The theoretical framework underlying the paper is twofold, being based on Matveev's theory of spines and on Thurston's idea (later developed by several authors) of constructing hyperbolic structures via triangulations. Many of our results were obtained (or suggested) by computer investigations.

Article information

Source
Experiment. Math. Volume 19, Issue 2 (2010), 211-236.

Dates
First available in Project Euclid: 17 June 2010

Permanent link to this document
http://projecteuclid.org/euclid.em/1276784791

Zentralblatt MATH identifier
05769998

Mathematical Reviews number (MathSciNet)
MR2676749

Subjects
Primary: 57M50: Geometric structures on low-dimensional manifolds
Secondary: 57M27: Invariants of knots and 3-manifolds 05C30: Enumeration in graph theory 57M20: Two-dimensional complexes

Keywords
Hyperbolic 3-manifolds knotted graphs complexity

Citation

Heard, Damian; Hodgson, Craig; Martelli, Bruno; Petronio, Carlo. Hyperbolic Graphs of Small Complexity. Experimental Mathematics 19 (2010), no. 2, 211--236. http://projecteuclid.org/euclid.em/1276784791.


Export citation