arXiv Analytics

Sign in

arXiv:0805.2425 [math.GT]AbstractReferencesReviewsResources

Minimal triangulations for an infinite family of lens spaces

William Jaco, J. Hyam Rubinstein, Stephan Tillmann

Published 2008-05-16Version 1

The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, 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 integer n>1, 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 spaces L(2n,1).

Related articles: Most relevant | Search more
arXiv:1107.4828 [math.GT] (Published 2011-07-25)
On Virtual Crossing Numbers for Virtual Knots
arXiv:1507.04088 [math.GT] (Published 2015-07-15)
A lower bound on minimal number of colors for links
arXiv:1602.05512 [math.GT] (Published 2016-02-17)
An Infinite Family of Links with Critical Bridge Spheres