November 7, 2003
Similar papers 2
May 24, 2013
In this work we present a complete (no misses, no duplicates) census for closed, connected, orientable and prime 3-manifolds induced by plane graphs with a bipartition of its edge set (blinks) up to $k=9$ edges. Blinks form a universal encoding for such manifolds. In fact, each such a manifold is a subtle class of blinks, \cite{lins2013B}. Blinks are in 1-1 correpondence with {\em blackboard framed links}, \cite {kauffman1991knots, kauffman1994tlr} We hope that this census be...
July 31, 2006
This is lecture notes of a talk I gave at the Morningside Center of Mathematics on June 20, 2006. In this talk, I survey on Poincare and geometrization conjecture.
July 18, 2002
0-efficient triangulations of 3-manifolds are defined and studied. It is shown that any triangulation of a closed, orientable, irreducible 3-manifold M can be modified to a 0-efficient triangulation or M can be shown to be one of the manifolds S^3, RP^3 or L(3,1). Similarly, any triangulation of a compact, orientable, irreducible, boundary-irreducible 3-manifold can be modified to a 0-efficient triangulation. The notion of a 0-efficient ideal triangulation is defined. It is s...
July 7, 2005
This is a survey article on finite type invariants of 3-manifolds written for the Encyclopedia of Mathematical Physics to be published by Elsevier.
April 19, 2004
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to check if a closed orientable 3-manifold, equipped with a minimal triangulation, is reducible or not. This result can easily be generalized to compact orientable 3-manifolds with non-empty boundary.
February 6, 2020
This survey focuses on the computational complexity of some of the fundamental decision problems in 3-manifold theory. The article discusses the wide variety of tools that are used to tackle these problems, including normal and almost surfaces, hierarchies, homomorphisms to finite groups, and hyperbolic structures.
June 2, 2014
This workshop about triangulations of manifolds in computational geometry and topology was held at the 2014 CG-Week in Kyoto, Japan. It focussed on computational and combinatorial questions regarding triangulations, with the goal of bringing together researchers working on various aspects of triangulations and of fostering a closer collaboration within the computational geometry and topology community. Triangulations are highly suitable for computations due to their clear...
July 31, 2014
This dissertation contains a comprehensive study of the topology of 2-manifolds and a complementary analysis of the work done by Edwin E. Moise, L. V. Ahlfors and Ian Richards. Our aim is to study the well known classification of surfaces. Here we present the technical tools needed for proving rigorously the classification theorem and give a detailed proof using these tools.
June 29, 2007
Starting from the (apparently) elementary problem of deciding how many different topological spaces can be obtained by gluing together in pairs the faces of an octahedron, we will describe the central role played by hyperbolic geometry within three-dimensional topology. We will also point out the striking difference with the two-dimensional case, and we will review some of the results of the combinatorial and computational approach to three-manifolds developed by different ma...
March 16, 2019
In this paper we study the manifolds in the census of "small" 3-manifolds as available in SnapPy. We compare our results with the statistics of random 3-manifolds obtained using the Dunfield Thurston and Rivin models.