Related papers: Lower bounds for simplicial covers and triangulati…
Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…
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$.…
In this article we study the following question: What can be the measure of the minimal solid angle of a simplex in $\mathbb{R}^d$? We show that in dimensions three it is not greater than the solid angle of the regular simplex. And in…
In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…
This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space…
How complex must two finite 2-complexes be to admit a common, but not finite common, covering? We obtain an almost answer: the minimum possible number of triangles in a pseudo-simplicial triangulation of each complex is 3, 4, or 5.
In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…
Given a polytope $\mathcal{P}$ in $\mathbb{R}^d$ and a subset $U$ of its vertices, is there a triangulation of $\mathcal{P}$ using $d$-simplices that all contain $U$? We answer this question by proving an equivalent and easy-to-check…
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…
The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…
In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…
We provide sharp lower bounds for the simplicial volume of compact $3$-manifolds in terms of the simplicial volume of their boundaries. As an application, we compute the simplicial volume of several classes of $3$-manifolds, including…
For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…
This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…
This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface…
One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…
It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…
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…
A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We first establish that, for any $d\ge 3$, for any $d\ge 3$,…
An extended formulation of a polytope P is a polytope Q which can be projected onto P. Extended formulations of small size (i.e., number of facets) are of interest, as they allow to model corresponding optimization problems as linear…