Related papers: How to make a triangulation of S^3 polytopal

We use bifurcation theory to determine the existence of infinitely many new examples of triply periodic minimal surfaces in $\mathbb R^3$. These new examples form branches issuing from the H-family, the rPD-family, the tP-family, and the…

We show that given a trivalent graph in $S^3$, either the graph complement contains an essential almost meridional planar surface or thin position for the graph is also bridge position. This can be viewed as an extension of a theorem of…

We prove the following results on flag triangulations of 2- and 3-manifolds. In dimension 2, we prove that the vertex-minimal flag triangulations of $\mathbb{R} P^2$ and $\mathbb{S}^1\times \mathbb{S}^1$ have 11 and 12 vertices,…

We define a new graph invariant called the scramble number. We show that the scramble number of a graph is a lower bound for the gonality and an upper bound for the treewidth. Unlike the treewidth, the scramble number is not minor monotone,…

Recently, Berge theta hypergraphs have received special attention due to the similarity with Berge even cycles. Let $r$-uniform Berge theta hypergraph $\Theta_{\ell,t}^{B}$ be the $r$-uniform hypergraph consisting of $t$ internally disjoint…

We present a simple randomized scheme for triangulating a set $P$ of $n$ points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of $P$ move continuously along piecewise algebraic…

Let $G$ be a finite group, and let $H$ be a subgroup of $G$. We compute the probability, denoted by $P_G(H)$, that a left transversal of $H$ in $G$ is also a right transversal, thus a two-sided one. Moreover, we define, and denote by…

We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…

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…

We construct homotopically non-trivial maps from S^m to S^n with arbitrarily small 3-dilation for certain pairs (m,n). The simplest example is m=4, n=3. Other examples include arbitrarily large values of m and n. We show that a homotopy…

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.

We investigate the computational complexity of some problems in three-dimensional topology and geometry. We show that the problem of determining a bound on the genus of a knot in a 3-manifold, is NP-complete. Using similar ideas, we show…

In this paper, we explore minimal contact triangulations on contact 3-manifolds. We give many explicit examples of contact triangulations that are close to minimal ones. The main results of this article say that on any closed oriented…

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

We study several properties of $\ZZ_2^n$-equivariant triangulations of $\RR P^n$. We show that a $\ZZ_2^n$-equivariant triangulation of $\RR P^n$ induces a triangulated subdivision of the orbit space $\bigtriangleup^n$. We show that any…

Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without…

We present a linear programming based algorithm for computing a spanning tree $T$ of a set $P$ of $n$ points in $\Re^d$, such that its crossing number is $O(\min(t \log n, n^{1-1/d}))$, where $t$ the minimum crossing number of any spanning…

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 present a new approach of creating PTAS to the TSP problems by defining a bounded-curvature surface embedded spaces. Using this definition we prove: - A bounded-curvature surface embedded spaces TSP admits to a PTAS. -…