Related papers: Improved upper bounds in the moving sofa problem

Let $\Omega$ be a bounded, smooth domain of $\mathbb{R}^{N},$ $N\geq1.$ For each $p>N$ we study the optimal function $s=s_{p}$ in the pointwise inequality \[ \left\vert v(x)\right\vert \leq s(x)\left\Vert \nabla v\right\Vert…

Parallel to $\widetilde{\mathrm{SL}(2,\mathbb{R})}$-geometry fibering over the hyperbolic plane, we construct a geometry fibering over the Siegel upper half-space $\mathrm{Sp}(2n,\mathbb{R})\curvearrowright {\mathfrak{H}}_n$, and provide a…

Consider the hyperplanes at a fixed distance $t$ from the center of the hypercube $[0,1]^d$. Significant attention has been given to determining the hyperplanes $H$ among these such that the $(d-1)$-dimensional volume of $H\cap[0,1]^d$ is…

Due to its fractal nature, much about the area of the Mandelbrot set $M$ remains to be understood. While a series formula has been derived by Ewing and Schober to calculate the area of $M$ by considering its complement inside the Riemann…

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called \emph{Main Problem of Subspace Coding} is to determine the maximum size…

In this paper we prove some geometric inequalities for closed surfaces in Euclidean three-space. Motivated by Gage's inequality for convex curves, we first verify that for convex surfaces the Willmore energy is bounded below by some…

We prove that the first eigenvalue of the Dirichlet Laplacian for a triangle in the plane is bounded above by $\pi^2 L^2\over 9A^2$, where $L$ is the perimeter and $A$ is the area of this triangle. We show that the \mbox{constant 9} is…

The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$,…

This paper studies the large time existence for the motion of closed hypersurfaces in a radially symmetric potential. In physical, this surface can be considered as an electrically charged membrane with a constant charge per area in a…

Let $A_1,A_2,...,A_n$ be the vertices of a polygon with unit perimeter, that is $\sum_{i=1}^n |A_i A_{i+1}|=1$. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of…

We study the slicing inequality for the surface area instead of volume. This is the question whether there exists a constant $\alpha_n$ depending (or not) on the dimension $n$ so that $$S(K)\leq\alpha_n|K|^{\frac{1}{n}}\max_{\xi\in…

Let $X$ be any subset of the interval $[-1,1]$. A subset $I$ of the unit sphere in $R^n$ will be called \emph{$X$-avoiding} if $<u,v >\notin X$ for any $u,v \in I$. The problem of determining the maximum surface measure of a $\{ 0…

In 1914 Lebesgue defined a "universal covering" to be a convex subset of the plane that contains an isometric copy of any subset of diameter 1. His challenge of finding a universal covering with the least possible area has been addressed by…

We give explicit isoperimetric upper bounds for all Steklov eigenvalues of a compact orientable surface with boundary, in terms of the genus, the length of the boundary, and the number of boundary components. Our estimates generalize a…

We carry out a systematic investigation on floating bodies in real space forms. A new unifying approach not only allows us to treat the important classical case of Euclidean space as well as the recent extension to the Euclidean unit…

This short note describes the tentative form of a finite-dimensional optimization problem that may be of use in a second-generation proof of the Kepler conjecture. In the original 1998 proof of the Kepler conjecture, the form of the…

We derive a procedure for computing an upper bound on the number of equiangular lines in various Euclidean vector spaces by generalizing the classical pillar decomposition developed by (Lemmens and Seidel, 1973); namely, we use linear…

We give an overview of the 2024 Computational Geometry Challenge targeting the problem \textsc{Maximum Polygon Packing}: Given a convex region $P$ in the plane, and a collection of simple polygons $Q_1, \ldots, Q_n$, each $Q_i$ with a…

The article presents a new method of linear programming, called the surface movement method. This method constructs an optimal objective path on the surface of the feasible polytope from the initial boundary point to the point at which the…

Branch-and-bound-based consensus maximization stands out due to its important ability of retrieving the globally optimal solution to outlier-affected geometric problems. However, while the discovery of such solutions caries high scientific…