Displaying similar documents to “Coloured knots and permutations representing 3-manifolds.”

Two-fold branched coverings of S have type six.

Maria Rita Casali (1992)

Revista Matemática de la Universidad Complutense de Madrid

Similarity:

In this work, we prove that every closed, orientable 3-manifold M which is a two-fold covering of S branched over a link, has type six.

3-manifold spines and bijoins.

Luigi Grasselli (1990)

Revista Matemática de la Universidad Complutense de Madrid

Similarity:

We describe a combinatorial algorithm for constructing all orientable 3-manifolds with a given standard bidimensional spine by making use of the idea of bijoin (Bandieri and Gagliardi (1982), Graselli (1985)) over a suitable pseudosimplicial triangulation of the spine.

Knots, butterflies and 3-manifolds..

H. M. Hilden, J. M. Montesinos, D. M. Tejada, M. M. Toro (2004)

Disertaciones Matemáticas del Seminario de Matemáticas Fundamentales

Similarity:

Open 3-manifolds, wild subsets of S and branched coverings.

José María Montesinos-Amilibia (2003)

Revista Matemática Complutense

Similarity:

In this paper, a representation of closed 3-manifolds as branched coverings of the 3-sphere, proved in [13], and showing a relationship between open 3-manifolds and wild knots and arcs will be illustrated by examples. It will be shown that there exist a 3-fold simple covering p : S --> S branched over the remarkable simple closed curve of Fox [4] (a wild knot). Moves are defined such that when applied to a branching set, the corresponding covering manifold remains unchanged, while...

Coverings of S branched over iterated torus links.

Carmen Safont (1990)

Revista Matemática de la Universidad Complutense de Madrid

Similarity:

Coverings of S 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...