The complexity of orientable graph manifolds-Reference-Cited by-同舟云学术

The complexity of orientable graph manifolds

Published:2022-01-01 Issue:1 Volume:22 Page:113-126
ISSN:1615-7168
Container-title:Advances in Geometry
language:en
Short-container-title:

Author:

Cattabriga Alessia¹,Mulazzani Michele²

Affiliation:

1. Department of Mathematics, University of Bologna , Piazza di Porta San Donato 5, 40126 Bologna , Italy

2. Department of Mathematics and ARCES, University of Bologna , Piazza di Porta San Donato 5, 40126 Bologna , Italy

Abstract

Abstract We give an upper bound for the Matveev complexity of the whole class of closed connected orientable prime graph manifolds; this bound is sharp for all 14502 graph manifolds of the Recogniser catalogue (available at http://matlas.math.csu.ru/?page=search)

Publisher

Walter de Gruyter GmbH

Subject

Geometry and Topology

Link

https://www.degruyter.com/document/doi/10.1515/advgeom-2021-0040/pdf

Reference16 articles.

1. F. Bonahon, Low-dimensional geometry, volume 49 of Student Mathematical Library. Amer. Math. Soc. 2009. MR2522946 Zbl 1176.57001

2. A. Cattabriga, S. Matveev, M. Mulazzani, T. Nasybullov, On the complexity of non-orientable Seifert fibre spaces. Indiana Univ. Math. J. 69 (2020), 421–451. MR4084177 Zbl 1445.57009

3. A. T. Fomenko, S. V. Matveev, Algorithmic and computer methods for three-manifolds, volume 425 of Mathematics and its Applications. Kluwer 1997. MR1486574 Zbl 0885.57009

4. E. Fominykh, M. Ovchinnikov, On the complexity of graph manifolds. Sib. Èlektron. Mat. Izv. 2 (2005), 190–191. MR2177992 Zbl 1150.57309

5. E. Fominykh, B. Wiest, Upper bounds for the complexity of torus knot complements. J. Knot Theory Ramifications 22 (2013), 1350053, 19 pages. MR3125892 Zbl 1290.57003