Related papers: Wetzel's sector covers unit arcs

Covering systems were introduced by Erd\H{o}s in 1950. In the same article where he introduced them, he asked if the minimum modulus of a covering system with distinct moduli is bounded. In 2015, Hough answered affirmatively this long…

The closed string field theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2\pi. Through every point in such a metric…

In this paper, we address the minimum-area rectangular and square annulus problem, which asks a rectangular or square annulus of minimum area, either in a fixed orientation or over all orientations, that encloses a set $P$ of $n$ input…

We give a proof of the planar case of a longstanding conjecture of Kneser (1955) and Poulsen (1954). In fact, we prove more by showing that if a finite set of disks in the plane is rearranged so that the distance between each pair of…

Given a triangle $\Delta$, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of $\Delta$ with respect to area and perimeter. This problem was initially posed by Nandakumar and was first…

In this work we study subdivisions of $k$-rotationally symmetric planar convex bodies that minimize the maximum relative diameter functional. For some particular subdivisions called $k$-partitions, consisting of $k$ curves meeting in an…

We investigate the box dimensions of compact sets in $\mathbb{R}^2$ that contain a unit distance in every direction (such sets may have zero Hausdorff dimension). Among other results, we show that the lower box dimension must be at least…

In 1934, Reinhardt asked for the centrally symmetric convex domain in the plane whose best lattice packing has the lowest density. He conjectured that the unique solution up to an affine transformation is the smoothed octagon (an octagon…

We study the collection of points on the modular surface obtained from the logarithm embeddings of the groups of units in totally real cubic number fields. We conjecture that this set is dense and show that its closure contains countably…

In 1969, Vic Klee asked whether a convex body is uniquely determined (up to translation and reflection in the origin) by its inner section function, the function giving for each direction the maximal area of sections of the body by…

We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…

We prove that a bounded linear Hilbert space operator has the unit circle in its essential approximate point spectrum if and only if it admits an orbit satisfying certain orthogonality and almost-orthogonality relations. This result is…

We determine the length of the shortest nontrivial geodesic loops on the Stiefel manifold endowed with any member of the one-parameter family of Riemannian metrics introduced by H\"uper et al. (2021). This family includes, in particular,…

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

This note concerns the so-called pyjama problem, whether it is possible to cover the plane by finitely many rotations of vertical strips of half-width $\varepsilon$. We first prove that there exist no periodic coverings for…

We prove existence of equal area partitions of the unit sphere via optimal transport methods, accompanied by diameter bounds written in terms of Monge--Kantorovich distances. This can be used to obtain bounds on the expectation of the…

We show that every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies. The previous result was $16$ copies established by Papadoperakis in 1999, while a conjecture by Hadwiger is $8$. We modify Papadoperakis's…

Consider a convex domain B of space. We prove that there exist complete minimal surfaces which are properly immersed in B. We also demonstrate that if D and D' are convex domains with D bounded and the closure of D contained in D' then any…

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…

We address the problem of one dimensional segment detection and estimation, in a regression setup. At each point of a fixed or random design, one observes whether that point belongs to the unknown segment or not, up to some additional…