Related papers: On a computer recognition of 3-manifolds

We give an elementary proof of the fact that any orientable 3-manifold admits a framing (i.e. is parallelizable) and any non-orientable 3-manifold admits a projective framing. The proof uses only basic facts about immersions of surfaces in…

Algorithms that decompose a manifold into simple pieces reveal the geometric and topological structure of the manifold, showing how complicated structures are constructed from simple building blocks. This note describes a way to…

We give a generalization of Thurston's Bounded Image Theorem for skinning maps, which applies to pared 3-manifolds with incompressible boundary that are not necessarily acylindrical. Along the way we study properties of divergent sequences…

We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…

We determine which 3-manifolds admit a unitary representation such that the corresponding twisted chain complex is acyclic.

We explicitly construct small triangulations for a number of well-known 3-dimensional manifolds and give a brief outline of some aspects of the underlying theory of 3-manifolds and its historical development.

The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra in any triangulation of the manifold. The main theorem of the paper gives upper and lower bounds on the triangulation complexity of any…

It is known since 1954 that every 3-manifold bounds a 4-manifold. Thus, for instance, every 3-manifold has a surgery diagram. There are several proofs of this fact, including constructive proofs, but there has been little attention to the…

The idea of computing Matveev complexity by using Heegaard decompositions has been recently developed by two different approaches: the first one for closed 3-manifolds via crystallization theory, yielding the notion of Gem-Matveev…

We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…

We give an upper bound for the Matveev complexity of the whole class of closed connected orientable prime graph manifolds that is sharp for all 14502 graph manifolds of the Recognizer catalogue (available at…

Complexity of patterns is a key information for human brain to differ objects of about the same size and shape. Like other innate human senses, the complexity perception cannot be easily quantified. We propose a transparent and universal…

We characterize the quasiprojective groups that appear as fundamental groups of compact $3$-manifolds (with or without boundary). We also characterize all closed $3$-manifolds that admit good complexifications. These answer questions of…

We describe an algorithm that takes as input an open book decomposition of a closed oriented 4-manifold and outputs an explicit trisection diagram of that 4-manifold. Moreover, a slight variation of this algorithm also works for open books…

We mimic the cognitive ability of Human perception, based on Bayesian hypothesis, to recognize view-based 3D objects. We consider approximate Bayesian (Empirical Bayesian) for perceptual inference for recognition. We essentially handle…

We study the large-scale geometry of 3-manifolds with nontrivial 2-dimensional bounded cohomology, with a view to proving a weak version of the geometrization conjecture for such manifolds.

In this paper we deal with Seifert fibre spaces, which are compact 3-manifolds admitting a foliation by circles. We give a combinatorial description for these manifolds in all the possible cases: orientable, non-orientable, closed, with…

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…

We present new computational methods for proving diffeomorphy of triangulated 4-manifolds, including algorithms and topological software that can for the first time effectively handle the complexities that arise in dimension four and be…

We give a new elementary proof of the parallelizability of closed orientable 3-manifolds. We use as the main tool the fact that any such manifold admits a Heegaard splitting.