We provide a simple algorithm which produces a (branched) standard spine of a 3-manifold presented by surgery along a framed link in S³, 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.

Amendola, G. (2002). An algorithm producing a standard spine of a 3-manifold presented by surgery along a link. RENDICONTI DEL CIRCOLO MATEMATICO DI PALERMO, 51, Serie 2, 179-198.

An algorithm producing a standard spine of a 3-manifold presented by surgery along a link

AMENDOLA, GENNARO
2002

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³, 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.
Articolo in rivista - Articolo scientifico
3-manifold, surgery, spine
English
179
198
Amendola, G. (2002). An algorithm producing a standard spine of a 3-manifold presented by surgery along a link. RENDICONTI DEL CIRCOLO MATEMATICO DI PALERMO, 51, Serie 2, 179-198.
Amendola, G
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/8645
Citazioni
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
Social impact