Related papers: Random collapsibility and 3-sphere recognition
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
A $d$-dimensional simplicial complex is balanced if the underlying graph is $(d+1)$-colorable. We present an implementation of cross-flips, a set of local moves introduced by Izmestiev, Klee and Novik which connect any two PL-homeomorphic…
We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…
We prove that there is an algorithm which determines whether or not a given 2-polyhedron can be embedded into some integral homology 3-sphere. This is a corollary of the following main result. Let $M$ be a compact connected orientable…
It is known that the $3$-sphere has at most $2^{O(n^2 \log n)}$ combinatorially distinct triangulations with $n$ vertices. Here we construct at least $2^{\Omega(n^2)}$ such triangulations.
Triangulations of the cube into a minimal number of simplices without additional vertices have been studied by several authors over the past decades. For $3\leq n\leq 7$ this so-called simplexity of the unit cube $I^n$ is now known to be…
3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…
It is known that any two triangulations of a compact 3-manifold are related by finite sequences of certain local transformations. We prove here an upper bound for the length of a shortest transformation sequence relating any two…
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…
We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…
We study a topological structure of a closed $n$-manifold $M^n$ ($n\geq 3$) which admits a Morse-Smale diffeomorphism such that codimension one separatrices of saddles periodic points have no heteroclinic intersections different from…
This paper studied the geometric and combinatorial aspects of the classical Lawson's flip algorithm in 1972. Let A be a finite set of points in R2, omega be a height function which lifts the vertices of A into R3. Every flip in…
It is known that any contact 3-manifold can be obtained by rational contact Dehn surgery along a Legendrian link L in the standard tight contact 3-sphere. We define and study various versions of contact surgery numbers, the minimal number…
In this paper, we show that two balanced triangulations of a closed surface are not necessary connected by a sequence of balanced stellar subdivisions and welds. This answers a question posed by Izmestiev, Klee and Novik. We also show that…
The aim of this paper is to give a survey of the known results concerning centrally symmetric polytopes, spheres, and manifolds. We further enumerate nearly neighborly centrally symmetric spheres and centrally symmetric products of spheres…
The present paper follows the computational approach to 3-manifold classification via edge-coloured graphs, already performed by several authors with respect to orientable 3-manifolds up to 28 coloured tetrahedra, non-orientable 3-manifolds…
We investigate topological properties of simple Morse functions with 4 critical points on immersed 2-spheres. To classify such functions, dual graph of immersion and Reeb graphs is used. We have found all possible structures of the…
Turaev Viro invariants are amongst the most powerful tools to distinguish 3-manifolds: They are implemented in mathematical software, and allow practical computations. The invariants can be computed purely combinatorially by enumerating…
Many cell functions require a concerted effort from multiple membrane proteins, for example, for signaling, cell division, and endocytosis. One contribution to their successful self-organization stems from the membrane deformations that…
Heegaard splittings stratify 3-manifolds by complexity; only $S^3$ admits a genus-zero splitting, and only $S^3$, $S^1 \times S^2$, and lens spaces $L(p,q)$ admit genus-one splittings. In dimension four, the second author and Jeffrey Meier…