Related papers: Bounding minimal solid angles of polytopes

A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…

This short note extends a recent result (Bonifas et al, On sub-determinants and the diameter of polyhedra, Discrete Computational Geometry, 52, 2014) of an upper bound of the diameter of a convex polytope defined by an integer matrix to a…

We investigate small covers and quasitoric over the duals of neighborly simplicial polytopes with small number of vertices in dimensions $4$, $5$, $6$ and $7$. In the most of the considered cases we obtain the complete classification of…

The mean width is a measure on three-dimensional convex bodies that enjoys equal status with volume and surface area [Rota]. As the phrase suggests, it is the mean of a probability density f. We verify formulas for mean widths of the…

In this paper, we establish that the non-zero dihedral angles of hyperbolic Coxeter polyhedra of large dimensions are not arbitrarily small. Namely, for dimensions $n\geq 32$, they are of the form $\frac{\pi}{m}$ with $m\leq 6$. Moreover,…

We consider triangle faced convex polyhedra inscribed in the unit sphere $S^2$ in ${\Bbb{R}}^3$. One way of measuring their deviation from regular polyhedra with triangular faces is to consider the quotient of the lengths of the longest and…

Macdonald studied a discrete volume measure for a rational polytope $P$, called solid angle sum, that gives a natural discrete volume for $P$. We give a local formula for the codimension two quasi-coefficient of the solid angle sum of $P$.…

Let $\mu$ be a probability distribution on $\mathbb{R}^d$ which assigns measure zero to every hyperplane and $S$ a set of points sampled independently from $\mu$. What can be said about the expected combinatorial structure of the convex…

We prove the theorem mentioned in the title, for ${\mathbb{R}}^n$, where $n \ge 3$. The case of the simplex was known previously. Also, the case $n=2$ was settled, but there the infimum was some well-defined function of the side lengths. We…

We determine the minimum number of vertices needed to provide balanced triangulations of $\mathbb S^{d-2}$-bundles over $\mathbb S^1$. If $d$ is odd and the bundle is orientable, or $d$ is even and the bundle is non-orientable, the minimum…

For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

This note introduces the class of basic $r$-ball polyhedra in the $d$-dimensional Euclidean space $\mathbb{E}^{d}$ for $d>1$ and $r>0$. We investigate their face structure and, for given integers $0\leq i\leq d-1$, $n\geq d+1\geq 3$…

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

For three dimensional complete Riemannian manifolds with scalar curvature no less than one, we obtain the sharp upper bound of complete stable minimal surfaces' diameter.

We define an analogue of the cube and an analogue of the 5-wedge in higher dimensions, each with $2d+2$ vertices and $d^2+2d-3$ edges. We show that these two are the only minimisers of the number of edges, amongst d-polytopes with $2d+2$…

In this article, we found all simple closed geodesics on regular spherical octahedra and spherical cubes. In addition, we estimate the number of simple closed geodesics on regular spherical tetrahedra.

We derive analytical expressions for the solid angle subtended by a right finite circular cylinder at a point source with cosine angular distribution in the case where the source direction is parallel to the cylinder axis. As a subsidiary…

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

The aim of this paper is to prove isoperimetric inequalities for simplices and polytopes with $d+2$ vertices in Euclidean, spherical and hyperbolic $d$-space. In particular, we find the minimal volume $d$-dimensional hyperbolic simplices…