Related papers: The isoperimetric problem for $3$-polytopes with s…
It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…
We formulate and give partial answers to several combinatorial problems on volumes of simplices determined by $n$ points in 3-space, and in general in $d$ dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by $n$…
We give coordinate-minimal geometric realizations in general position for 17 of the 20 vertex-minimal triangulations of the orientable surface of genus 3 in the 5x5x5-cube.
An abstract polytope is \emph{flat} if every facet is incident on every vertex. In this paper, we prove that no chiral polytope has flat finite regular facets and finite regular vertex-figures. We then determine the three smallest non-flat…
In this article, we solve the relative isoperimetric problem in $[0,1]^3$ for orthogonal polyhedra. Up to isometries of the cube or sets of measure $0$, the minimizers are of the form $[0,\epsilon]^3$, $[0,\epsilon]^2 \times [0,1]$, or…
This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…
We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…
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$…
Motivated by problems on apparent horizons in general relativity, we prove the following theorem on minimal surfaces: Let $g$ be a metric on the three-sphere $S^3$ satisfying $Ric(g) \geq 2 g$. If the volume of $(S^3, g)$ is no less than…
This paper deals with the three types of regular polytopes which exist in all dimensions -- regular simplices, cubes and regular cross-polytopes -- and their outer and inner radii. While the inner radii of regular simplices are well…
K3 polytopes appear in complements of tropical quartic surfaces. They are dual to regular unimodular central triangulations of reflexive polytopes in the fourth dilation of the standard tetrahedron. Exploring these combinatorial objects, we…
We characterize the standard $\mathbb{S}^3$ as the closed Ricci-positive 3-manifold with scalar curvature at least 6 having isoperimetric surfaces of largest area: $4\pi$. As a corollary we answer in the affirmative an interesting special…
Pogorelov proved in 1949 that every every convex polyhedron has at least three simple closed quasigeodesics. Whereas a geodesic has exactly pi surface angle to either side at each point, a quasigeodesic has at most pi surface angle to…
In this paper we consider a class of right-angled polyhedra in three-dimensional Lobachevsky space, all vertices of which lie on the absolute. New upper bounds on volumes in terms the number of faces of the polyhedron are obtained. Volumes…
In this paper we obtain new upper bounds on volumes of right-angled polyhedra in hyperbolic space $\mathbb{H}^3$ in three different cases: for ideal polyhedra with all vertices on the ideal hyperbolic boundary, for compact polytopes with…
A 1957 conjecture by Zdzislaw Melzak, that the unit volume polyhedron with least edge length was a triangular right prism, with edge length $2^{2/3}3^{11/6}$. We present a variety of necessary local criteria for any minimizer. In the case…
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
We prove that the 8^4_2 link complement is the minimal volume orientable hyperbolic manifold with 4 cusps. Its volume is twice of the volume V_8 of the ideal regular octahedron, i.e. 7.32... = 2V_8. The proof relies on Agol's argument used…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…