Related papers: On a computer recognition of 3-manifolds
We construct examples of nonresolvable generalized $n$-manifolds, $n\geq 6$, with arbitrary resolution obstruction, homotopy equivalent to any simply connected, closed $n$-manifold. We further investigate the structure of generalized…
We present a simple combinatorial method to encode 3-dimensional manifolds, based on their Heegaard diagrams. The notion of a Gauss diagram of a 3-manifold is introduced. We check the conditions for a Gauss diagram to represent a closed…
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…
In this short expository note, we give a detailed proof of Markov's theorem on the unsolvability of the homeomorphism problem and of the existence of unrecognizable manifolds in all dimensions larger than 3.
The Hilbert scheme of projective 3-folds of codimension 3 or more that are linear scrolls over the projective plane or over a smooth quadric surface or that are quadric or cubic fibrations over the projective line is studied. All known such…
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
The Kakimizu complex is usually defined in the context of knots, where it is known to be quasi-Euclidean. We here generalize the definition of the Kakimizu complex to surfaces and 3-manifolds (with or without boundary). Interestingly, in…
By analogy with associative and co-associative cases we introduce a class of three-dimensional non-orientable submanifolds, of almost $\mathrm{G}_2-$manifolds, modelled on planes lying in a special $\mathrm{G}_2-$orbit. An application of…
We discuss the computational complexity and feasibility properties of scenario based techniques for uncertain optimization programs. We consider different solution alternatives ranging from the standard scenario approach to recursive…
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…
We study the problem of orbifold deconstruction, i.e., the process of recognizing, using only readily available information, whether a given conformal model can be realized as an orbifold, and the identification of the twist group and the…
The Heegaard genus is a fundamental invariant of 3-manifolds. However, computing the Heegaard genus of a triangulated 3-manifold is NP-hard, and while algorithms exist, little work has been done in making such an algorithm efficient and…
Identifying the entire set of complexes is essential not only to understand complex formations, but also to map the high level organisation of the cell. Computational prediction of protein complexes faces several challenges including the…
We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…
Through computer enumeration with the aid of topological results, we catalogue all 18 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most eight tetrahedra. In addition we give an overview as to how the 100…
We introduce the notion of a manifold admitting a simple compact Cartan 3-form $\om^3$. We study algebraic types of such manifolds specializing on those having skew-symmetric torsion, or those associated with a closed or coclosed 3-form…
For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…
In this paper, we proved that any closed orientable 3-manifold 1-dominates at most finitely many geometric 3-manifolds.
In complex plasmas, the behavior of freely floating micrometer sized particles is studied. The particles can be directly visualized and recorded by digital video cameras. To analyze the dynamics of single particles, reliable algorithms are…
A classification theorem is given of projective threefolds that are covered by a two-dimensional family of lines, but not by a higher dimensional family.