Related papers: On the maximum volume solid wrappable by a given s…
Let $p$ be a positive number. Consider probability measure $\gamma_p$ with density $\varphi_p(y)=c_{n,p}e^{-\frac{|y|^p}{p}}$. We show that the maximal surface area of a convex body in $\mathbb{R}^n$ with respect to $\gamma_p$ is…
A thin circular elastic sheet floating on a drop-like liquid substrate is deformed due to incompatibility between the curved substrate and the planar sheet. We adopt a variational viewpoint by minimizing the non-convex membrane energy…
In this note, we estimate the upper bound of volume of closed positively or nonnegatively curved Alexandrov space $X$ with strictly convex boundary. We also discuss the equality case. In particular, the Boundary Conjecture holds when the…
In this paper we show that bending a finite volume hyperbolic $d$-manifold $M$ along a totally geodesic hypersurface $\Sigma$ results in a properly convex projective structure on $M$ with finite volume. We also discuss various geometric…
We give two new upper bounds on the covering minima of convex bodies, depending on covering minima of certain projections and intersections with linear subspaces. We show one bound to be sharp for direct sums of two convex bodies,…
A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or…
In a book embedding, the vertices of a graph are placed on the spine of a book and the edges are assigned to pages, so that edges on the same page do not cross. In this paper, we prove that every $1$-planar graph (that is, a graph that can…
Using an idea of Voronoi in the geometric theory of positive definite quadratic forms, we give a transparent proof of John's characterization of the unique ellipsoid of maximum volume contained in a convex body. The same idea applies to the…
It was conjectured by Ulam that the ball has the lowest optimal packing fraction out of all convex, three-dimensional solids. Here we prove that any origin-symmetric convex solid of sufficiently small asphericity can be packed at a higher…
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a…
We prove that every complete non-compact manifold of finite volume contains a (possibly non-compact) minimal hypersurface of finite volume. The main tool is the following result of independent interest: if a region $U$ can be swept out by a…
A packing by a body $K$ is collection of congruent copies of $K$ (in either Euclidean or hyperbolic space) so that no two copies intersect nontrivially in their interiors. A covering by $K$ is a collection of congruent copies of $K$ such…
We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…
Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…
Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…
Given a polyhedral surface, assume that it is prohibited to change the shape and size of any face but it is permissible to change the dihedral angles between the faces. A polyhedral surface is said to be flexible if it is possible to change…
We consider a convex Euclidean hypersurface that evolves by a volume or area preserving flow with speed given by a general nonhomogeneous function of the mean curvature. For a broad class of possible speed functions, we show that any closed…
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 show that in all dimensions d>2, there exists an asymmetric convex body of revolution all of whose maximal hyperplane sections have the same volume. This gives the negative answer to the question posed by V. Klee in 1969.
In 1900, as a part of his 18th problem, Hilbert proposed the question to determine the densest congruent (or translative) packings of a given solid, such as the unit ball or the regular tetrahedron of unit edges. Up to now, our knowledge…