Related papers: On the maximum volume solid wrappable by a given s…
Many objects in nature and industry are wrapped in a thin sheet to enhance their chemical, mechanical, or optical properties. There are similarly a variety of methods for wrapping, from pressing a film onto a hard substrate, to using…
When a thin sheet is crushed into a small three-dimensional volume, it invariably forms a structure with a low volume fraction but high resistance to further compression. Being a far-from-equilibrium process, forced crumpling is not…
In this work we discuss a conjecture of Viterbo relating the symplectic capacity of a convex body and its volume. The conjecture states that among all 2n-dimensional convex bodies with a given volume the euclidean ball has maximal…
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…
Let $H$ be a Hilbert space. For a closed convex body $A$ denote by $r(A)$ the supremum of radiuses of balls, contained in $A$. We prove, that $\sum_{n=1}^\infty r(A_n) \ge r(A)$ for every covering of a convex closed body $A \subset H$ by a…
In this paper, we extend and generalize several previous works on maximal-volume positions of convex bodies. First, we analyze the maximal positive-definite image of one convex body inside another, and the resulting decomposition of the…
In this paper we deal with problems concerning the volume of the convex hull of two "connecting" bodies. After a historical background we collect some results, methods and open problems, respectively.
In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can…
The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…
We study the supremum of the volume of hyperbolic polyhedra with some fixed combinatorics and with vertices of any kind (real, ideal or hyperideal). We find that the supremum is always equal to the volume of the rectification of the…
We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…
The new result of this paper connected with the following problem: Consider a supporting hyperplane of a regular simplex and its re ected image at this hyperplane. When will be the volume of the convex hull of these two simplices maximal?…
The intrinsic volumes are measures of the content of a convex body. This paper uses probabilistic and information-theoretic methods to study the sequence of intrinsic volumes of a convex body. The main result states that the intrinsic…
Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…
The largest discs contained in a regular tetrahedron lie in its faces. The proof is closely related to the theorem of Fritz John characterising ellipsoids of maximal volume contained in convex bodies.
Motivated by modern applications like image processing and wireless sensor networks, we consider a variation of the famous Kepler Conjecture. Given any infinite set of unit balls covering the whole space, we want to know the optimal (lim…
Let $\Delta$ be the optimal packing density of $\mathbb R^n$ by unit balls. We show the optimal packing density using two sizes of balls approaches $\Delta + (1 - \Delta) \Delta$ as the ratio of the radii tends to infinity. More generally,…
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the…
We investigate, by means of computer simulations, shapes of nonconvex bodies that maximize resistance to their motion through a rarefied medium, considering that bodies are moving forward and at the same time slowly rotating. A…
The simplex was conjectured to be the extremal convex body for the two following "problems of asymmetry":\\ P1) What is the minimal possible value of the quantity $\max_{K'} |K'|/|K|$? Here, $K'$ ranges over all symmetric convex bodies…