Related papers: Pessimal packing shapes

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

Let $P$ be a set of $n$ points on the plane in general position. We say that a set $\Gamma$ of convex polygons with vertices in $P$ is a convex decomposition of $P$ if: Union of all elements in $\Gamma$ is the convex hull of $P,$ every…

This paper settles the existence question for a rather general class of convex optimal design problems with a volume constraint. In low dimensions, we prove the existence of an optimal configuration for general convex minimization problems…

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…

We investigate lattice packings of Minkowski's balls and domains, as well as the distribution of lattice points on Minkowski's curves which are boundaries of Minkowski's balls. By results of the proof of Minkowski's conjecture about the…

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 problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…

Abstract Equivalent conditions that make the convex subdifferential maximal monotone are investigated in the general settings of locally convex spaces.

In 1978, Makai Jr. established a remarkable connection between the volume-product of a convex body, its maximal lattice packing density and the minimal density of a lattice arrangement of its polar body intersecting every affine hyperplane.…

In this paper we are interested in "optimal" universal geometric inequalities involving the area, diameter and inradius of convex bodies. The term "optimal" is to be understood in the following sense: we tackle the issue of…

In this paper we consider metric fillings of convex bodies. We show that convex bodies $C\subset \mathbb{R}^n$ are the unique minimal fillings of their boundary metrics among all integral current spaces. To this end, we also prove that…

The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…

Let $K$ be a convex pentagon in the plane and let $K_1$ be the pentagon bounded by the diagonals of $K$. It has been conjectured that the maximum of the ratio between the areas of $K_1$ and $K$ is reached when $K$ is an affine regular…

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

Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic…

The isoperimetric problem with a density or weighting seeks to enclose prescribed weighted area with minimum weighted perimeter. According to Chambers' recent proof of the Log Convex Density Conjecture, for many densities on $\mathbb{R}^n$…

The lower dimensional Busemann-Petty problem asks whether origin symmetric convex bodies in $\mathbb{R}^n$ with smaller volume of all $k$-dimensional sections necessarily have smaller volume. As proved by Bourgain and Zhang, the answer to…

Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…

We give bounds on the successive minima of an $o$-symmetric convex body under the restriction that the lattice points realizing the successive minima are not contained in a collection of forbidden sublattices. Our investigations extend…

For every convex disk $K$ (a convex compact subset of the plane, with non-void interior), the packing density $\delta(K)$ and covering density $\vartheta(K)$ form an ordered pair of real numbers, {\em i.e.}, a point in ${\mathbb R}^2$. The…