Skip Navigation

Journal of Topology 2009 2(1):157-180; doi:10.1112/jtopol/jtp004
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Jaco, W.
Right arrow Articles by Tillmann, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2009 London Mathematical Society

Minimal triangulations for an infinite family of lens spaces

William Jaco

Department of Mathematics, Oklahoma State University, Stillwater, OK 74078-1058, USA, jaco@math.okstate.edu

Hyam Rubinstein and Stephan Tillmann

Department of Mathematics and Statistics, The University of Melbourne, VIC 3010, Australia, rubin@ms.unimelb.edu.au, tillmann@ms.unimelb.edu.au


  Abstract

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).

Received May 16, 2008.

2000 Mathematics Subject Classification 57M25, 57N10


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.