Related papers: An Improved Lower Bound for Moser's Worm Problem
In this paper we give a lower bound on the waist of the unit sphere of a uniformly convex normed space by using the localization technique in codimension greater than one and a strong version of the Borsuk-Ulam theorem. The tools used in…
We consider unbranched Willmore surfaces in the Euclidean space that arise as inverted complete minimal surfaces with embedded planar ends. Several statements are proven about upper and lower bounds on the Morse Index - the number of…
Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…
We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…
We prove the theorem mentioned in the title, for ${\mathbb{R}}^n$, where $n \ge 3$. The case of the simplex was known previously. Also, the case $n=2$ was settled, but there the infimum was some well-defined function of the side lengths. We…
We prove that if $M$ is a three-manifold with scalar curvature greater than or equal to -2 and $\Sigma\subset M$ is a two-sided compact embedded Riemann surface of genus greater than 1 which is locally area-minimizing, then the area of…
The Moving Sofa Problem, formally proposed by Leo Moser in 1966, seeks to determine the largest area of a two-dimensional shape that can navigate through an $L$-shaped corridor with unit width. The current best lower bound is about 2.2195,…
Given any asymptotically flat 3-manifold $(M,g)$ with smooth, non-empty, compact boundary $\Sigma$, the conformal conjecture states that for every $\delta>0$, there exists a metric $g' = u^4 g$, with $u$ a harmonic function, such that the…
We show that a bumpy closed Riemannian manifold $(M^{n+1}, g)$ $(3 \leq n+1 \leq 7)$ admits a sequence of connected closed embedded two-sided minimal hypersurfaces whose areas and Morse indices both tend to infinity. This improves a…
In this paper we obtain an analogue of Toponogov theorem in dimension 3 for compact manifolds $M^3$ with nonnegative Ricci curvature and strictly convex boundary $\partial M$. Here we obtain a sharp upper bound for the length…
We prove that the unique least-perimeter way of partitioning the unit 2-dimensional disk into three regions of prescribed areas is by means of the standard graph consisting in three balanced constant geodesic curvature curves meeting…
Bounds for the area of general closed marginally trapped surfaces (MTSs) are presented. They do not require any stability condition, and are determined by a constant that depends on a particular component of the Einstein tensor on the…
The width of a closed convex subset of Euclidean space is the distance between two parallel supporting planes. The Blaschke-Lebesgue problem consists of minimizing the volume in the class of convex sets of fixed constant width and is still…
We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…
A {\em maximal partial ovoid} of a generalized quadrangle is a maximal set of points no two of which are collinear. The problem of determining the smallest size of a maximal partial ovoid in quadrangles has been extensively studied in the…
We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…
Let $(M^{n+1},\partial M,g)$ be a compact manifold with non-negative Ricci curvature, convex boundary and $2\leq n\leq 6$. We show that the min-max minimal hypersurface with respect to one-parameter families of hypersurfaces in $(M,\partial…
This paper studies hidden convexity properties associated with constrained optimization problems over the set of rotation matrices $\text{SO}(n)$. Such problems are nonconvex due to the constraint $X \in \text{SO}(n)$. Nonetheless, we show…
Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by orthogonal sweeps was first studied in [2]. Here we consider…
The problem of finding small sets that block every line passing through a unit square was first considered by Mazurkiewicz in 1916. We call such a set {\em opaque} or a {\em barrier} for the square. The shortest known barrier has length…