Related papers: An Improved Lower Bound for Moser's Worm Problem

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…

This article is concerned with the problem of placing seven or eight points on the unit sphere $\mathbb{S}^2$ in $\mathbb{R}^3$ so that the surface area of the convex hull of the points is maximized. In each case, the solution is given for…

The aim of this paper is twofold. First, we cut off a part of a convex surface by a plane near a ridge point and characterize the limiting behavior of the surface measure in $S^2$ induced by this part of surface when the plane approaches…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

We study a problem of minimal surfaces with free boundary written in the form of a non convex minimization problem. Our aim is to characterize optimal solutions by finding a suitable calibration field. A natural upper bound of the infimum…

We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an…

Monsky's theorem from 1970 states that a square cannot be dissected into an odd number of triangles of the same area, but it does not give a lower bound for the area differences that must occur. We extend Monsky's theorem to "constrained…

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

For appropriately values of $H$, we obtain an area estimate for a complete non-compact $H$-surface of finite topology and finite area, embedded in a three-manifold of negative curvature. Moreover, in the case of equality and under…

We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existence and uniqueness result for an optimal algorithm for…

We consider the problem of estimating the volume of a compact domain in a Euclidean space based on a uniform sample from the domain. We assume the domain has a boundary with positive reach. We propose a data splitting approach to correct…

The second and fourth authors have conjectured that a certain hollow tetrahedron $\Delta$ of width $2+\sqrt2$ attains the maximum lattice width among all three-dimensional convex bodies. We here prove a local version of this conjecture:…

The purpose of this article is study rigidity of free boundary minimal two-disks that locally maximize the modified Hawking mass on a Riemannian three-manifold with positive lower bound on its scalar curvature and mean convex boundary.…

We give two new upper bounds on the covering minima of convex bodies, depending on covering minima of certain projections and intersections with linear subspaces. We show one bound to be sharp for direct sums of two convex bodies,…

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…

We develop a sketching algorithm to find the point on the convex hull of a dataset, closest to a query point outside it. Studying the convex hull of datasets can provide useful information about their geometric structure and their…

The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…

We prove that in every metric space where no line contains all the points, there are at least $\Omega(n^{2/3})$ lines. This improves the previous $\Omega(\sqrt{n})$ lower bound on the number of lines in general metric space, and also…

This work puts forward a form finding problem of designing a least-volume vault that is a surface structure spanning over a plane region, which via pure compression transfers a vertically tracking load to the supporting boundary. Through a…

In this paper, we show that the total area of two distinct surfaces with Gaussian curvature equal to 1, which are also conformal to the Euclidean unit disk with the same conformal factor on the boundary, must be at least 4{\pi}. In other…