Related papers: A New Slant on Lebesgue's Universal Covering Probl…
Consider the problem of fnding the smallest area convex $k$-gon containing $n\in\mathbb{N}$ congruent disks without an overlap. By using Wegner inequality in sphere packing theory we give a lower bound for the area of such polygons. For…
In this note we propose a min-max theory for embedded hypersurfaces with a fixed boundary and apply it to prove several theorems about the existence of embedded minimal hypersurfaces with a given boundary. A simpler variant of these…
The problem considered first by I. Newton (1687) consists in finding a surface of the minimal frontal resistance in a parallel flow of non-interacting point particles. The standard formulation assumes that the surface is convex with a given…
Let $\Omega\subset\r^n$ be a bounded mean convex domain. If $\alpha<0$, we prove the existence and uniqueness of classical solutions of the Dirichlet problem in $\Omega$ for the $\alpha$-singular minimal surface equation with arbitrary…
Essential covers were introduced by Linial and Radhakrishnan as a model that captures two complementary properties: (1) all variables must be included and (2) no element is redundant. In their seminal paper, they proved that every essential…
Biedl et al. introduced the minimum ply cover problem in CG 2021 following the seminal work of Erlebach and van Leeuwen in SODA 2008. They showed that determining the minimum ply cover number for a given set of points by a given set of…
The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…
An opaque set (or a barrier) for $U \subseteq \mathbb{R}^2$ is a set $B$ of finite-length curves such that any line intersecting $U$ also intersects $B$. In this paper, we consider the lower bound for the shortest barrier when $U$ is the…
The first two installments of this series of papers dealt with the maximum area polygons: Parallelogram, Rectangle, Square or Equilateral Triangle, in given triangles. Minimum area polygons were also considered in the second paper on…
We study the problem of finding, for a given one-dimensional topological space $X$, a cover of $X$ of smallest size by geodesics with respect to some metric. The infimal size of such a set is called the metric geodesic cover number of $X$.…
The covering radius problem is a question in coding theory concerned with finding the minimum radius $r$ such that, given a code that is a subset of an underlying metric space, balls of radius $r$ over its code words cover the entire metric…
We prove upper and lower bounds on the minimal spherical dispersion, improving upon previous estimates obtained by Rote and Tichy [Spherical dispersion with an application to polygonal approximation of curves, Anz. \"Osterreich. Akad. Wiss.…
We prove that Alexandrov's conjecture relating the area and diameter of a convex surface holds for the surface of a general ellipsoid. This is a direct consequence of a more general result which estimates the deviation from the optimal…
In this paper, we mainly consider the relative isoperimetric inequalities for minimal submanifolds with free boundary. We first generalize ideas of restricted normal cones introduced by Choe-Ghomi-Ritor\'e in \cite{CGR06} and obtain an…
Bayesian model averaging is a procedure to obtain parameter constraints that account for the uncertainty about the correct cosmological model. We use recent cosmological observations and Bayesian model averaging to derive tight limits on…
We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…
Hadwiger's conjecture in convex geometry, formulated in 1957, states that every convex body in $\mathbb{R}^n$ can be covered by $2^n$ translations of its interior. Despite significant efforts, the best known bound related to this problem…
We study the problem of computing the minimum area triangle that circumscribes a given $n$-sided convex polygon touching edge-to-edge. In other words, we compute the minimum area triangle that is the intersection of 3 half-planes out of $n$…
By using a suitable triple cover we show how to possibly model the construction of a minimal surface with positive genus spanning all six edges of a tetrahedron, working in the space of BV functions and interpreting the film as the boundary…
This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.