Given an special type of triangulation T for an oriented closed 3-manifold M3 we produce a framed link in S3 which induces the same M3 by an algorithm of complexity O(n2) where n is the number of tetrahedra in T. The special class is formed by the duals of the solvable gems. These are in practice computationaly easy to obtain from any triangulation for M3. The conjecture that each closed oriented 3-manifold is induced by a solvable gem has been verified in an exhaustible way for manifolds induced by gems with few vertices. Our algorithm produces framed link presentations for well known 3-manifolds which hitherto did not one explicitly known. A consequence of this work is that the 3-manifold invariants which are presently only computed from ...
AbstractThe present paper looks at Matveev's complexity (introduced in 1990 and based on the existen...
We have defined the weight of the pair (aOE (c) Sa R pound >,R) for a given presentation aOE (c) Sa ...
The present paper looks at Matveev's complexity (introduced in 1990 and based on the existence of a ...
In this final part of a 3-part paper we introduce the pair of “wings ” of the abstract PL-colored co...
This is part 2 of a 3-part article where we provide an O(n2)-algorithm to produce a surgery presenta...
We introduce a natural-valued complexity c(X) for pairs X=(M,L), where M is a closed orientable 3-ma...
We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that ap...
We provide a simple algorithm which produces a (branched) standard spine of a 3-manifold presented b...
. We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3...
AbstractFrom each G in a certain class of 4-regular edge-colored graphs we obtain a ball complex who...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
Abstract. A triangulation of S3 denes uniquely a number m 4; a sub-graph of and a representation...
The present paper looks at Matveev's complexity (introduced in 1990 and based on the existence of a ...
We have defined the weight of the pair (aOE (c) Sa R pound >,R) for a given presentation aOE (c) Sa ...
AbstractThe present paper looks at Matveev's complexity (introduced in 1990 and based on the existen...
We have defined the weight of the pair (aOE (c) Sa R pound >,R) for a given presentation aOE (c) Sa ...
The present paper looks at Matveev's complexity (introduced in 1990 and based on the existence of a ...
In this final part of a 3-part paper we introduce the pair of “wings ” of the abstract PL-colored co...
This is part 2 of a 3-part article where we provide an O(n2)-algorithm to produce a surgery presenta...
We introduce a natural-valued complexity c(X) for pairs X=(M,L), where M is a closed orientable 3-ma...
We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that ap...
We provide a simple algorithm which produces a (branched) standard spine of a 3-manifold presented b...
. We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3...
AbstractFrom each G in a certain class of 4-regular edge-colored graphs we obtain a ball complex who...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
Abstract. A triangulation of S3 denes uniquely a number m 4; a sub-graph of and a representation...
The present paper looks at Matveev's complexity (introduced in 1990 and based on the existence of a ...
We have defined the weight of the pair (aOE (c) Sa R pound >,R) for a given presentation aOE (c) Sa ...
AbstractThe present paper looks at Matveev's complexity (introduced in 1990 and based on the existen...
We have defined the weight of the pair (aOE (c) Sa R pound >,R) for a given presentation aOE (c) Sa ...
The present paper looks at Matveev's complexity (introduced in 1990 and based on the existence of a ...