The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Uniqueness of the embedding of a 2-complex into a 3-manifold.”

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.

Dotted links, Heegaard diagrams, and colored graphs for PL 4-manifolds.

Maria Rita Casali (2004)

Revista Matemática Complutense

Similarity:

The present paper is devoted to establish a connection between the 4-manifold representation method by dotted framed links (or -in the closed case- by Heegaard diagrams) and the so called crystallization theory, which visualizes general PL-manifolds by means of edge-colored graphs. In particular, it is possible to obtain a crystallization of a closed 4-manifold M4 starting from a Heegaard diagram (#m(S1 x S2...

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...