Coverings of S3 branched over iterated torus links.

Carmen Safont

Revista Matemática de la Universidad Complutense de Madrid (1990)

  • Volume: 3, Issue: 2-3, page 181-210
  • ISSN: 1139-1138

Abstract

top
Coverings of S3 branched over iterated torus links appear naturally and very often in Algebraic Geometry. The natural graph-manifold structure of the exterior of an iterated torus link induces a graph-structure in the branched covers. In this paper we give an algorithm to compute valued graphs representing a branched cover given the monodromy representation associated to the covering. The algorithm is completely mechanized in order to be programmed, and can also be used for finding representation of groups of iterated torus links.

How to cite

top

Safont, Carmen. "Coverings of S3 branched over iterated torus links.." Revista Matemática de la Universidad Complutense de Madrid 3.2-3 (1990): 181-210. <http://eudml.org/doc/43651>.

@article{Safont1990,
abstract = {Coverings of S3 branched over iterated torus links appear naturally and very often in Algebraic Geometry. The natural graph-manifold structure of the exterior of an iterated torus link induces a graph-structure in the branched covers. In this paper we give an algorithm to compute valued graphs representing a branched cover given the monodromy representation associated to the covering. The algorithm is completely mechanized in order to be programmed, and can also be used for finding representation of groups of iterated torus links.},
author = {Safont, Carmen},
journal = {Revista Matemática de la Universidad Complutense de Madrid},
keywords = {Grafos; Teoría de grafos; Nudos; Enlaces; Nudos; fundamental groups; Coverings; iterated torus links; graph-manifold structure; branched covers; monodromy representation},
language = {eng},
number = {2-3},
pages = {181-210},
title = {Coverings of S3 branched over iterated torus links.},
url = {http://eudml.org/doc/43651},
volume = {3},
year = {1990},
}

TY - JOUR
AU - Safont, Carmen
TI - Coverings of S3 branched over iterated torus links.
JO - Revista Matemática de la Universidad Complutense de Madrid
PY - 1990
VL - 3
IS - 2-3
SP - 181
EP - 210
AB - Coverings of S3 branched over iterated torus links appear naturally and very often in Algebraic Geometry. The natural graph-manifold structure of the exterior of an iterated torus link induces a graph-structure in the branched covers. In this paper we give an algorithm to compute valued graphs representing a branched cover given the monodromy representation associated to the covering. The algorithm is completely mechanized in order to be programmed, and can also be used for finding representation of groups of iterated torus links.
LA - eng
KW - Grafos; Teoría de grafos; Nudos; Enlaces; Nudos; fundamental groups; Coverings; iterated torus links; graph-manifold structure; branched covers; monodromy representation
UR - http://eudml.org/doc/43651
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.