Related papers: Optimality of Gerver's Sofa

Design requirements for moving parts in mechanical assemblies are typically specified in terms of interactions with other parts. Some are purely kinematic (e.g., pairwise collision avoidance) while others depend on physics and material…

The convex shape contained in a disk having prescribed area and maximal perimeter is completely characterized in terms of the area fraction. The solution is always a polygon having all but one sides equal. The lengths of the sides are…

Hilbert's two-dimensional space-filling curve is appreciated for its good locality properties for many applications. However, it is not clear what is the best way to generalize this curve to filling higher-dimensional spaces. We argue that…

We prove that strictly convex surfaces moving by $K^{\alpha/2}$ become spherical as they contract to points, provided $\alpha$ lies in the range $[1,2]$. In the process we provide a natural candidate for a curvature pinching quantity for…

It is known for a long time that a nonsingular real algebraic curve of degree 2k in the projective plane cannot have more than 7/2*k^2-9/4*k+3/2$ even ovals. We show here that this upper bound is asymptotically sharp, that is to say we…

In this paper, we study the deformation of the n-dimensional strictly convex hypersurface in $\mathbb R^{n+1}$ whose speed at a point on the hypersurface is proportional to $\alpha$-power of positive part of Gauss Curvature. For…

We introduce extremal affine surface areas in a functional setting. We show their main properties. Among them are linear invariance, isoperimetric inequalities and monotonicity properties. We establish a new duality formula, which shows…

In this paper, we study the divisor theory of the Simpson moduli space of semistable sheaves of dimension 1 on the projective plane. We prove that these spaces are all Mori dream spaces, and calculate their nef cones. We also study the…

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.…

We describe a factor-revealing convex optimization problem for the integrality gap of the maximum-cut semidefinite programming relaxation: for each $n \geq 2$ we present a convex optimization problem whose optimal value is the largest…

We give an explicit formula for the $27$ lines of a smooth cubic surface near the Fermat surface. Our formula involves convergent power series with coefficients in the extension of rational numbers with the sixth root of unity. Our main…

The gonality of a smooth geometrically connected curve over a field $k$ is the smallest degree of a nonconstant $k$-morphism from the curve to the projective line. In general, the gonality of a curve of genus $g \ge 2$ is at most $2g - 2$.…

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…

Let $G_n$ be a non-extensible, flexible closed curve of length $n$ in the 3-space $\R^3$ with $n$ particles $A_1$,...,$A_n$ evenly fixed (according to the arc length of $G_n$) on the curve. Let $f:(0, \infty)\to \R$ be an increasing and…

We give a complete description of all order 1 invariants of spherical curves. We also identify the subspaces of all J-invariants and S-invariants, and present two equalities satisfied by any spherical curve.

Let $k \geq 2$ be a constant. Given any $k$ convex polygons in the plane with a total of $n$ vertices, we present an $O(n\log^{2k-3}n)$ time algorithm that finds a translation of each of the polygons such that the area of intersection of…

We study the boundedness problem for maximal operators $\mathbb{M}_{\sigma}$ associated to flat plane curves with Mitigating factors, defined by $$\mathbb{M}_{\sigma}f(x) \, := \, \sup_{1 \leq t \leq 2} \left|\int_{0}^{1} f(x-t\Gamma(s)) \,…

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…

We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal…

We present a new algebraic algorithmic scheme to solve {\em convex integer maximization} problems of the following form, where $c$ is a convex function on $R^d$ and $w_1x,...,w_dx$ are linear forms on $R^n$, $$\max \{c(w_1 x,...,w_d x):…