Related papers: A New Slant on Lebesgue's Universal Covering Probl…
The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality…
We prove that the first gap of $\mathbb R$-complementary thresholds of surfaces is $\frac{1}{13}$. More precisely, the largest $\mathbb R$-complementary threshold for surfaces that is strictly less than $1$ is $\frac{12}{13}$. This result…
In this paper we study the global regularity for the solution to the Dirichlet problem of the equation of minimal graphs over a convex domain in hyperbolic spaces. We find that the global regularity depends only on the convexity of the…
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…
Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…
In this article, we study the problem of obtaining Lebesgue space inequalities for the Fourier restriction operator associated to rectangular pieces of the paraboloid and perturbations thereof. We state a conjecture for the dependence of…
The classical minimum principle is foundational in convex and complex analysis and plays an important role in the study of the real and complex Monge-Ampere equations. This note establishes a minimum principle in Lagrangian geometry. This…
Often some interesting or simply curious points are left out when developing a theory. It seems that one of them is the existence of an upper bound for the fraction of area of a convex and closed plane area lying outside a circle with which…
This note concerns the area growth and bottom spectrum of complete stable minimal surfaces in a three-dimensional manifold with scalar curvature bounded from below. When the ambient manifold is the Euclidean space, by an elementary…
We prove that every unit area convex pentagon is contained in a convex quadrilateral of area no greater than $3/\sqrt{5}$, and that every unit area convex hexagon is contained in a convex pentagon of area no greater than $7/6$. Both results…
We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…
Given a set of $n$ points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of the disks. The problem is NP-hard and several approximation…
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…
P\'al's classical isominwidth inequality states that the regular triangle has minimal area among plane convex bodies of minimal width $w$. A similar result is the Blaschke--Lebesgue inequality that states that Reuleaux triangles minimize…
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…
In every dimension $d\ge1$, we establish the existence of a constant $v_d>0$ and of a subset $\mathcal U_d$ of $\mathbb R^d$ such that the following holds: $\mathcal C+\mathcal U_d=\mathbb R^d$ for every convex set $\mathcal C\subset…
We study the Minimum Sum Vertex Cover problem, which asks for an ordering of vertices in a graph that minimizes the total cover time of edges. In particular, n vertices of the graph are visited according to an ordering, and for each edge…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
We establish a "neighborhood" variant of the cubical KKM lemma and the Lebesgue covering theorem and deduce a discretized version which is a "neighborhood" variant of Sperner's lemma on the cube. The main result is the following: for any…