Related papers: The Lebesgue Universal Covering Problem
The isoperimetric problem with a density or weighting seeks to enclose prescribed weighted volume with minimum weighted perimeter. According to Chambers' recent proof of the log-convex density conjecture, for many densities on…
With the popularity of drone technologies, aerial photography has become prevalent in many daily scenarios such as environment monitoring, structure inspection, law enforcement etc. A central challenge in this domain is the efficient…
L^p spaces of mappings taking values in arbitrary metric spaces, which we call nonlinear Lebesgue spaces, play an important role in several fields of mathematics. For instance, membership in these spaces is typically required for transport…
The Cayley--Salmon theorem implies the existence of a 27-sheeted covering space specifying lines contained in smooth cubic surfaces over $\mathbb{C}$. In this paper we compute the rational cohomology of the total space of this cover, using…
In their famous 1974 paper introducing the local lemma, Erd\H{o}s and Lov\'asz posed a question-later referred by Erd\H{o}s as one of his three favorite open problems: What is the minimum number of edges in an $r$-uniform, intersecting…
The paper focuses on possible hyperbolic versions of the classical Pal isominwidth inequality in R^2 from 1921, which states that for a fixed minimal width, the regular triangle has minimal area. We note that the isominwidth problem is…
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…
Forty years ago Schaer and Wetzel showed that a $\frac{1}{\pi}\times\frac {1}{2\pi}\sqrt{\pi^{2}-4}$ rectangle, whose area is about $0.122\,74,$ is the smallest rectangle that is a cover for the family of all closed unit arcs. More recently…
The convex shape contained in a disk having prescribed area and maximal perimeter is completely characterized in terms of the area fraction. The solution is always a polygon having all but one sides equal. The lengths of the sides are…
For regular one-dimensional variational problems, Ball and Nadirashvilli introduced the notion of the universal singular set of a Lagrangian L and established its topological negligibility. This set is defined to be the set of all points in…
We study problems on covering $[0,1)$ by shrinking intervals centered at the points $\{q_n x\}$, where $(q_n)_{n\in \mathbb{N}}$ is a given real-valued sequence and $x \in [0,1)$ is random. For real-valued lacunary sequences…
The Opaque Cover Problem (OCP), also known as the Beam Detector Problem, is the problem of finding, for a set S in Euclidean space, the minimum-length set F which intersects every straight line passing through S. In spite of its simplicity,…
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…
We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (possibly with holes) by a minimum number of convex subsets, a…
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…
In the Set Cover problem, we are given a set system with each set having a weight, and we want to find a collection of sets that cover the universe, whilst having low total weight. There are several approaches known (based on greedy…
The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…
The edge geodesic cover problem of a graph $G$ is to find a smallest number of geodesics that cover the edge set of $G$. The edge $k$-general position problem is introduced as the problem to find a largest set $S$ of edges of $G$ such that…
Paul Erd\H{o}s posed the question of whether every measurable planar set of infinite Lebesgue measure contains the four vertices of an isosceles trapezoid of unit area. In this paper, we provide an affirmative answer to this question.…
This article deals with the existence of hypersurfaces minimizing general shape functionals under certain geometric constraints. We consider as admissible shapes orientable hypersurfaces satisfying a so-called reach condition, also known as…