Related papers: Improved upper bounds in the moving sofa problem

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. Let $\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$…

We consider area minimizing $m$-dimensional currents $\mathrm{mod}(p)$ in complete $C^2$ Riemannian manifolds $\Sigma$ of dimension $m+1$. For odd moduli we prove that, away from a closed rectifiable set of codimension $2$, the current in…

We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…

A convex polygon Q is circumscribed about a convex polygon P if every vertex of P lies on at least one side of Q. We present an algorithm for finding a maximum area convex polygon circumscribed about any given convex n-gon in O(n^3) time.…

This note concerns the area growth and bottom spectrum of complete stable minimal surfaces in a three-dimensional manifold with scalar curvature bounded from below. When the ambient manifold is the Euclidean space, by an elementary…

A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…

Monsky's theorem from 1970 states that a square cannot be dissected into an odd number of triangles of the same area, but it does not give a lower bound for the area differences that must occur. We extend Monsky's theorem to "constrained…

By explicitly constructing the Hilbert space, Higuchi showed that there is a lower bound on the mass of a minimally-coupled free spin-2 field on a curved background \cite{HiguchiBound}. Using the vacuum persistence amplitude, we show that…

This article focuses on the problem of analytically determining the optimal placement of five points on the unit sphere $\mathbb{S}^2$ so that the surface area of the convex hull of the points is maximized. It is shown that the optimal…

In Ahlfors' covering surface theory, it is well known that there exists a positive constant $h$ such that for any nonconstant holomorphic mapping $f:% \bar{\Delta}\to S,$ if $f(\Delta)\cap \{0,1,\infty \}=\emptyset ,$ then% A(f,\Delta)\leq…

We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an…

For a family of weight functions invariant under a finite reflection group, the boundedness of a maximal function on the unit sphere is established and used to prove a multiplier theorem for the orthogonal expansions with respect to the…

We obtain some sharp estimates for the $p$-torsion of convex planar domains in terms of their area, perimeter, and inradius. The approach we adopt relies on the use of web functions (i.e. functions depending only on the distance from the…

Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…

Imagine a polygon-shaped platform $P$ and only one static spotlight outside $P$; which direction should the spotlight face to light most of $P$? This problem occurs in maximising the visibility, as well as in limiting the uncertainty in…

We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…

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$ sides are unknown when $s \ge 4$. In this paper, we propose an approach to construct convex small $n$-gons of…

We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…

An upper bound for the maximum number of rational points on an hypersurface in a projective space over a finite field has been conjectured by Tsfasman and proved by Serre in 1989. The analogue question for hypersurfaces on weighted…

We study the properties of the maximal volume $k$-dimensional sections of the $n$-dimensional cube $[-1,1]^n$. We obtain a first order necessary condition for a $k$-dimensional subspace to be a local maximizer of the volume of such…