Related papers: Observations from the 8-tetrahedron non-orientable…

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…

We outline the proof that non-triangulable manifolds exist in any dimension greater than four. The arguments involve homology cobordism invariants coming from the Pin(2) symmetry of the Seiberg-Witten equations. We also explore a related…

Given five points in a three-dimensional euclidean space, one can consider five tetrahedra, using those points as vertices. We present a pentagon-like formula containing the product of three volumes of those tetrahedra in its l.h.s. and the…

The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any triangulation of the 3-manifold. We compute the triangulation complexity of all elliptic 3-manifolds and all sol 3-manifolds, to within a…

There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…

This chapter provides a comprehensive survey of foundational results and recent advances concerning minimal generating sets for the mapping class group of a nonorientable surface, $\mathrm{Mod}(N_{g})$, and its index-two twist subgroup,…

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P with the polygonal faces identified in…

We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3-manifolds up to complexity 8. The program can treat also not necessarily closed 3-manifolds of bigger complexities, but here some…

We give coordinate-minimal geometric realizations in general position of all 865 vertex-minimal triangulations of the orientable surface of genus 2 in the 4x4x4-cube.

The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…

It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…

In this paper, we study polyhedral 3-manifolds with nonnegative curvature and integral monodromy, two conditions motivated by Thurston's work in arXiv:math/9801088. We classify the 32 isometry types of codimension 3 singularities in such…

There are only 10 Euclidean forms, that is flat closed three dimensional manifolds: six are orientable and four are non-orientable. The aim of this paper is to describe all types of $n$-fold coverings over orientable Euclidean manifolds…

A triangulation of a compact 3-manifold is annular-efficient if it is 0-efficient and the only normal, incompressible annuli are thin edge-linking. If a compact 3-manifold has an annular-efficient triangulation, then it is irreducible,…

For closed oriented manifolds, we establish oriented homotopy invariance of higher signatures that come from the fundamental group of a large class of orientable 3-manifolds, including the ``piecewise geometric'' ones in the sense of…

It is known that there are four-manifolds which are not algorithmically recognizable. This implies that there exist triangulations of these manifolds which are separated by large barriers from the point of view of the computer algorithm. We…

In this sequel to earlier papers by three of the authors, we obtain a new bound on the complexity of a closed 3--manifold, as well as a characterisation of manifolds realising our complexity bounds. As an application, we obtain the first…

A method is developed here for building differentiable three-dimensional manifolds on multicube structures. This method constructs a sequence of reference metrics that determine differentiable structures on the cubic regions that serve as…