Related papers: Deciding nonconstructibility of 3-balls with stric…
We define essential and strongly essential triangulations of 3-manifolds, and give four constructions using different tools (Heegaard splittings, hierarchies of Haken 3-manifolds, Epstein-Penner decompositions, and cut loci of Riemannian…
We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly non-simple) closed curve on the boundary of M, decide whether this curve is contractible in M. Our algorithm runs in space polynomial in…
Let $M$ be a non-compact hyperbolic $3$-manifold with finite volume and totally geodesic boundary components. By subdividing mixed ideal polyhedral decompositions of $M$, under some certain topological conditions, we prove that $M$ has an…
Given a compact oriented triangulated $3$-manifold we find a non-trivial condition satisfied by certain labelings of the tetrahedra by elements of an arbitrary abelian group which we call angle structures. Smoothness of the manifold is used…
In this note we construct a flag simplicial $3$-sphere $\Delta$ with the following properties: - $\Delta$ is not a suspension; - $\Delta$ has no edge that can be contracted to obtain another flag sphere; - The only equators (induced…
In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…
In micro- and nano-scale systems, particles can be moved by using an external force like gravity or a magnetic field. In the presence of adhesive particles that can attach to each other, the challenge is to decide whether a shape is…
We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into $\mathbb{R}^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an $\mathbb{S}^{3}$…
When a thin sheet is crushed into a small three-dimensional volume, it invariably forms a structure with a low volume fraction but high resistance to further compression. Being a far-from-equilibrium process, forced crumpling is not…
It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…
We prove that for any knot $K$, there exists a one-vertex triangulation of the $3$-sphere containing an edge forming $K$. The proof is constructive, and based on fully augmented links. We use our method to produce ``complicated'' simplicial…
We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…
We prove that for all $d \geq 1$ a shellable $d$-dimensional simplicial complex with at most $d+3$ vertices is extendably shellable. The proof involves considering the structure of `exposed' edges in chordal graphs as well as a connection…
In the Euclidean unit three-ball, we construct compact, embedded, two-sided free boundary minimal surfaces with connected boundary and prescribed high genus, by a gluing construction tripling the equatorial disc. Aside from the equatorial…
In this article, we prove that the commensurability class of a closed, orientable, hyperbolic 3-manifold is determined by the surface subgroups of its fundamental group. Moreover, we prove that there can be only finitely many closed,…
The paper deals with recursive constructions for simple 3-designs based on other 3-designs having $(1, \sigma)$-resolution. The concept of $(1, \sigma)$-resolution may be viewed as a generalization of the parallelism for designs. We show…
In this paper, we provide a deterministic polynomial time algorithm that determines satisfiability of 3-SAT. The complexity analysis for the algorithm takes into account no efficiency and yet provides a low enough bound, that efficient…
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…
Wojtkowski's system of $N$, $N \geq 2$, falling balls is a nonuniformly hyperbolic smooth dynamical system with singularities. It is still an open question whether this system is ergodic. We contribute towards an affirmative answer, by…
We consider the minimal entropy problem, namely the question of whether there exists a smooth metric of minimal entropy, for certain classes of 3-manifolds. Among other resulsts, we show that if M is a closed, orientable, geometrizable…