Minimal triangulations for an infinite family of lens spaces

By W. Jaco, H. Rubinstein, Stephan Tillmann. 2008

79 citations recorded by the source corpus.

The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein, and unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed its minimal layered triangulation. This paper proves that for each n ⩾ 2, the minimal layered triangulation of the lens space L(2n, 1) is its unique minimal triangulation. More generally, the minimal triangulations (and hence the complexity) are determined for an infinite family of lens spaces containing the lens space of the form L(2n, 1).

Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/128e5723b0f72740afbc1f816d6544c4321895b6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Graphics and Computer-Aided Design

1. Stephan Tillmann
2. H. Rubinstein
3. W. Jaco

In Geometry and Topology

1. Stephan Tillmann
2. H. Rubinstein
3. W. Jaco

Citations in the corpus

• Coverings and minimal triangulations of 3-manifolds (2009, background): “The following proof assumes familiarity with the standard models of low degree edges in minimal triangulations given in [4].”