相关论文: Observations from the 8-tetrahedron non-orientable…

We describe an algorithm which has enabled us to give a complete list, without repetitions, of all closed oriented irreducible 3-manifolds of complexity up to 9. More interestingly, we have actually been able to give a "name" to each such…

We classify the orientable finite-volume hyperbolic 3-manifolds having non-empty compact totally geodesic boundary and admitting an ideal triangulation with at most four tetrahedra. We also compute the volume of all such manifolds, we…

One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…

We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R^3. We also provide examples of minimal vertex triangulations of closed, connected, orientable…

We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can…

It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…

We classify all closed non-orientable P2-irreducible 3-manifolds with complexity up to 7, fixing two mistakes in our previous complexity-up-to-6 classification. We show that there is no such manifold with complexity less than 6, five with…

We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…

We classify all closed non-orientable P2-irreducible 3-manifolds having complexity up to 6 and we describe some having complexity 7. We show in particular that there is no such manifold with complexity less than 6, and that those having…

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…

We enumerate all spaces obtained by gluing in pairs the faces of the octahedron in an orientation-reversing fashion. Whenever such a gluing gives rise to non-manifold points, we remove small open neighbourhoods of these points, so we…

A normal pseudomanifold is a pseudomanifold in which the links of simplices are also pseudomanifolds. So, a normal 2-pseudomanifold triangulates a connected closed 2-manifold. But, normal $d$-pseudomanifolds form a broader class than…

We construct examples of non-formal simply connected and compact oriented manifolds of any dimension bigger or equal to 7.

Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…

A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…

A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

A triangulation of a $3$-manifold can be shown to be homeomorphic to the $3$-sphere by describing a discrete Morse function on it with only two critical faces, that is, a sequence of elementary collapses from the triangulation with one…

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…