Related papers: A lower bound technique for triangulations of simp…
This paper exhibits a structural strategy to produce new minimal submanifolds in spheres based on two given ones. The method is to spin the given minimal submanifolds by a curve $\gamma\subset \mathbb S^3$ in a balanced way and leads to…
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…
We develop tools for characterizing vertices of fiber products of polytopes and apply them to simplicial distribution polytopes, a class of probability polytopes arising in quantum foundations and quantum information. In the theory of…
Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number…
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…
It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…
We prove that if an $n$-dimensional space $X$ satisfies certain topological conditions then any triangulation of $X$ as well as any its representation as a simplicial set with contractible faces has at least $2^n$ faces of dimension $n$.…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
A triangulation of a circle bundle $ E \xrightarrow[\text{}]{\pi} B$ is a triangulation of the total space $E$ and the base $B$ such that the projection $\pi$ is a simplicial map. In the paper we address the following questions: Which…
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have…
For a 3-dimensional manifold $M^3$, its complexity $c(M^3)$, introduced by S.Matveev, is the minimal number of vertices of an almost simple spine of $M^3$; in many cases it is equal to the minimal number of tetrahedra in a singular…
We study the double homology associated to triangulated spheres and present two results. First, we explicitly compute the double homology for minimum degree sphere triangulations. Using a spectral sequence argument, we compute the effect of…
It is known that an ideal triangulation of a compact $3$-manifold with nonempty boundary is minimal if and only if it contains the minimum number of edges among all ideal triangulations of the manifold. Therefore, any ideal one-edge…
Triangulations of a product of two simplices and, more generally, of root polytopes are closely related to Gelfand-Kapranov-Zelevinsky's theory of discriminants, to tropical geometry, tropical oriented matroids, and to generalized…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
0-efficient triangulations of 3-manifolds are defined and studied. It is shown that any triangulation of a closed, orientable, irreducible 3-manifold M can be modified to a 0-efficient triangulation or M can be shown to be one of the…
We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…
We compute a lower bound for the number of simplices that are needed to triangulate the Grassmann manifold $G_k(\mathbb{R}^n)$. In particular, we show that the number of top-dimensional simplices grows exponentially with $n$. More precise…
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…
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…