Related papers: Improved upper bounds in the moving sofa problem
The moving sofa problem asks for the connected shape with the largest area $\mu_{\text{max}}$ that can move around the right-angled corner of a hallway $L$ with unit width. The best bounds currently known on $\mu_{\max}$ are summarized as…
The moving sofa problem, posed by L. Moser in 1966, asks for the planar shape of maximal area that can move around a right-angled corner in a hallway of unit width, and is conjectured to have as its solution a complicated shape derived by…
In 1966, Leo Moser introduced the "moving sofa problem," which seeks to determine the largest area of a shape that can be maneuvered through a 90-degree hallway of unit-width. This problem remains unsolved and open yet. In this paper, we…
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,…
We resolve the moving sofa problem by showing that Gerver's construction with 18 curve sections attains the maximum area $2.2195\cdots$.
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m \ge 7$. In this paper, we construct, for each $n=2m$ and $m\ge 3$, a small $n$-gon whose area is the maximal value…
A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…
We show that any convex region which contains a unit segment, an equilateral triangle of sides 1/2, and a square of side 1/3 always has area at least 0.227498. Using grid-search algorithm, we attempt to find a configuration of these three…
The problem widely known as Moser's Square Packing Problem asks for the smallest area $A$ such that for any set $S$ of squares of total area $1$, there exists a rectangle $R$ of area $A$ into which the squares in $S$ permit an…
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.…
It was shown by K. Ball and F. Nazarov, that the maximal surface area of a convex set in $\mathbb{R}^n$ with respect to the Standard Gaussian measure is of order $n^{\frac{1}{4}}$. In the present paper we establish the analogous result for…
We consider eight natural planar corridors, including the standard $\mathrm{L}$-shaped one, and characterize the rectangles that can move around their corners. As a bi-product we describe completely the corresponding rectangles with maximum…
A polygon is \textit{small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small…
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…
We show that every planar convex body is contained in a quadrangle whose area is less than $(1 - 2.6 \cdot 10^{-7}) \sqrt{2}$ times the area of the original convex body, improving the best known upper bound by W. Kuperberg.
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
In 1959, Erd\H{o}s and Moser asked for the maximum number of unit distances that may be formed among the vertices of a convex $n$-gon; until now, the best known upper bound has been $2\pi n \log_2 n + O(n)$, achieved by F\"uredi in 1990. In…
Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…
The goal of this paper is to present a lower bound for the Mahler volume of at least 4-dimensional symmetric convex bodies. We define a computable dimension dependent constant through a 2-dimensional variational (max-min) procedure and…