Related papers: Bounding minimal solid angles of polytopes
An n-simplex is said to be n-well-centered if its circumcenter lies in its interior. We introduce several other geometric conditions and an algebraic condition that can be used to determine whether a simplex is n-well-centered. These…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…
In this paper we consider min-max minimal surfaces in three-manifolds and prove some rigidity results. For instance, we prove that any metric on a 3-sphere which has scalar curvature greater than or equal to 6 and is not round must have an…
A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates…
Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…
We consider how flat a lattice simplex contained in the hypercube $[0,k]^d$ can be. This question is related to the notion of kissing polytopes: two lattice polytopes contained in the hypercube $[0,k]^d$ are kissing when they are disjoint…
We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…
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…
The mix of two maniplexes is the minimal maniplex that covers both. This construction has many important applications, such as finding the smallest regular cover of a maniplex. If one of the maniplexes is an abstract polytope, a natural…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
We prove that the regular octahedron has the minimal surface area among 3-polytopes of given volume and having at most six vertices.
We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the…
We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…
A polygon is \textit{small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small…
A tetrahedron is called a path tetrahedron, if it has three mutually orthogonal edges that do not intersect at a single point. A tetrahedron is called a 4-ball tetrahedron, if there exists a sphere tangent to all its edges. We derive…
The aim of this note is to investigate isoperimetric-type problems for $3$-dimensional parallelohedra; that is, for convex polyhedra whose translates tile the $3$-dimensional Euclidean space. Our main result states that among…
We classify here combinatorially rigid simple polytopes with three facets more than their dimension.
It is proved that the projection constants of two- and three-dimensional spaces are bounded by $4/3$ and $(1+\sqrt 5)/2$, respectively. These bounds are attained precisely by the spaces whose unit balls are the regular hexagon and…
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$.…