We give a simple combinatoric proof of an exponential upper bound on the number of distinct 3-manifolds that can be constructed by successively identifying nearest neighbour pairs of triangles in the boundary of a simplicial 3-ball and show that all closed simplicial manifolds that can be constructed in this manner are homeomorphic to S3. We discuss the problem of proving that all 3-dimensional simplicial spheres can be obtained by this construction and give an example of a simplicial 3-ball whose boundary triangles can be identified pairwise such that no triangle is identified with any of its neighbours and the resulting 3-dimensional simplicial complex is a simply connected 3-manifold
Abstract. We prove that the number of combinatorially distinct causal 3-dimensional triangulations h...
AbstractThe construction of 3-manifolds via Dehn surgery on links in S3 is an important technique in...
We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 24...
It is proven that the partition function of 3-dimensional simplicial gravity has an exponential uppe...
Through techniques of controlled topology we determine the entropy function characterizing the distr...
In this note, we consider the minimal entropy problem, namely the question of whether there exists a...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
AbstractIt is proved that every combinatorial 3-manifold with at most eight vertices is a combinator...
We compute the Minimal Entropy for every closed, orientable 3-manifold, showing that its cube equals...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
We show how Gromov's spaces of bounded geometries provide a general mathematical framework for addre...
We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that ap...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
AbstractIn the field of Geometric Modelling, as well as in theoretical physics, 2- and 3-combinatori...
AbstractR.H. Bing showed that if a closed 3-manifold M has a triangulation in which the 3-simplexes ...
Abstract. We prove that the number of combinatorially distinct causal 3-dimensional triangulations h...
AbstractThe construction of 3-manifolds via Dehn surgery on links in S3 is an important technique in...
We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 24...
It is proven that the partition function of 3-dimensional simplicial gravity has an exponential uppe...
Through techniques of controlled topology we determine the entropy function characterizing the distr...
In this note, we consider the minimal entropy problem, namely the question of whether there exists a...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
AbstractIt is proved that every combinatorial 3-manifold with at most eight vertices is a combinator...
We compute the Minimal Entropy for every closed, orientable 3-manifold, showing that its cube equals...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
We show how Gromov's spaces of bounded geometries provide a general mathematical framework for addre...
We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that ap...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
AbstractIn the field of Geometric Modelling, as well as in theoretical physics, 2- and 3-combinatori...
AbstractR.H. Bing showed that if a closed 3-manifold M has a triangulation in which the 3-simplexes ...
Abstract. We prove that the number of combinatorially distinct causal 3-dimensional triangulations h...
AbstractThe construction of 3-manifolds via Dehn surgery on links in S3 is an important technique in...
We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 24...