Related papers: Minimum polyhedron with $n$ vertices

We show that the maximum number of convex polygons in a triangulation of $n$ points in the plane is $O(1.5029^n)$. This improves an earlier bound of $O(1.6181^n)$ established by van Kreveld, L\"offler, and Pach (2012) and almost matches the…

Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…

We prove that a connected properly immersed minimal surface in Euclidean 3-space with infinite symmetry group whose intersection with a ball of radius R is less than 2\piR^2 is a plane, a catenoid or a Scherk singly-periodic minimal…

The volume of a Meissner polyhedron is computed in terms of the lengths of its dual edges. This allows to reformulate the Meissner conjecture regarding constant width bodies with minimal volume as a series of explicit finite dimensional…

We discover some very general configuration results for constructing area-minimizing cones. In particular, given any closed minimal submanifold in some Euclidean sphere, every cone over the minimal product of sufficiently many copies of the…

We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph)…

We classify closed, simply connected $n$-manifolds of non-negative sectional curvature admitting an isometric torus action of maximal symmetry rank in dimensions $2\leq n\leq 6$. In dimensions $3k$, $k=1,2$ there is only one such manifold…

A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…

We develop a method to find a set of diminimal polyhedral maps on the torus from which all other polyhedral maps on the torus may be generated by face splitting and vertex splitting. We employ this method, though not to its completion, to…

The hexagon is the least-perimeter tile in the Euclidean plane for any given area. On hyperbolic surfaces, this "isoperimetric" problem differs for every given area, as solutions do not scale. Cox conjectured that a regular $k$-gonal tile…

We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…

For positive integers $n,d$, let $\lambda(n,d)$ be the minimal number of vertices of a triangulation of $n$-sphere which admits a degree $d$ simplicial map to the boundary of $(n+1)$-simplex. We show that…

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ sides are unknown when $s \ge 4$. In this paper, we propose an approach to construct convex small $n$-gons of…

In this paper, we show that any biharmonic simple rotational surface in the four-dimensional Euclidean space is minimal. The proof is based on reducing the biharmonic equation to a system of ordinary differential equations for the profile…

We show that there are no edge-to-edge tilings of the sphere by congruent pentagons beyond the minimal dodecahedron tiling, such that there is a tile with all vertices having degree 3 and the edge length combinations are three of the five…

It was shown by Ramanathan \cite{R} that any compact oriented non-simply-connected minimal surface in the three-dimensional round sphere admits at most a finite set of pairwise noncongruent minimal isometric immersions. Here we show that…

We show that every minimum area isosceles triangle containing a given triangle $T$ shares a side and an angle with $T$. This proves a conjecture of Nandakumar motivated by a computational problem. We use our result to deduce that for every…

Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes the number of squares that share a common intersection,…

We identify least-perimeter unit-area tilings of the plane by convex pentagons, namely tilings by Cairo and Prismatic pentagons, find infinitely many, and prove that they minimize perimeter among tilings by convex polygons with at most five…