Alessia Cattabriga, Michele Mulazzani
Published 2019-02-11Version 1
We give an upper bound for the Matveev complexity of the whole class of closed orientable graph manifolds that is sharp for all the 14529 graph manifolds of the Recognizer catalogue (see http://matlas.math.csu.ru/?page=search ). The proof of this result will be contained in a forthcoming version of this paper.
An upper bound on stick numbers of knots
A geometric characterization of the upper bound for the span of the Jones polynomial
Upper bound on delta-crossing and tabulation of knots up to four delta-crossings
![QR code for arXiv:1902.03881 [math.GT]](http://oss.arxitics.com/images/favicon.svg)