We provide a simple algorithm which produces a (branched) standard spine of a 3-manifold presented by surgery along a framed link in S^3, giving an explicit upper bound on the complexity of the spine in terms of the complexity of a diagram of the link. As a corollary, we get an easy constructive proof of Casler’s result on the existence of a standard spine for a closed 3-manifold. We also describe an o-graph which represents the spine.
An algorithm producing a standard spine of a 3-manifold presented by surgery along a link
AMENDOLA, GENNARO
2002-01-01
Abstract
We provide a simple algorithm which produces a (branched) standard spine of a 3-manifold presented by surgery along a framed link in S^3, giving an explicit upper bound on the complexity of the spine in terms of the complexity of a diagram of the link. As a corollary, we get an easy constructive proof of Casler’s result on the existence of a standard spine for a closed 3-manifold. We also describe an o-graph which represents the spine.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
