Related papers: Pessimal packing shapes
Rotation Averaging is a non-convex optimization problem that determines orientations of a collection of cameras from their images of a 3D scene. The problem has been studied using a variety of distances and robustifiers. The intrinsic (or…
Using transversality and a dimension reduction argument, a result of A. Bezdek and W. Kuperberg is applied to polycylinders $\mathbb{D}^2\times \mathbb{R}^n$, showing that the optimal packing density is $\pi/\sqrt{12}$ in any dimension.
Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…
We consider shape optimization problems of the form $$\min\big\{J(\Omega)\ :\ \Omega\subset X,\ m(\Omega)\le c\big\},$$ where $X$ is a metric measure space and $J$ is a suitable shape functional. We adapt the notions of $\gamma$-convergence…
In earlier works \cite{Sz06-1}, \cite{Sz06-2}, \cite{Sz13-3} and \cite{Sz13-4} we have investigated the densest packings and the least dense coverings by congruent hyperballs (hyperspheres) to the regular prism tilings in $n$-dimensional…
The notion of a completely saturated packing [Fejes Toth, Kuperberg and Kuperberg, Highly saturated packings and reduced coverings, Monats. Math. 125 (1998) 127-145] is a sharper version of maximum density, and the analogous notion of a…
In this paper we extend the local scalar curvature rigidity result in [6] to a small domain on general vacuum static spaces, which confirms the interesting dichotomy of local surjectivity and local rigidity about the scalar curvature in…
We consider the problem of wrapping three-dimensional solid bodies with a given planar sheet of paper, where the paper may be folded or wrinkled but not stretched or torn. We propose a conjecture characterising the maximumvolume solid…
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We develop a min-max theory for the area functional in the class of locally wedge-shaped manifolds. Roughly speaking, a locally wedge-shaped manifold is a Riemannian manifold that is allowed to have both boundary and certain types of edges.…
The Busemann-Petty problem asks whether origin-symmetric convex bodies in real Euclidean n-space with smaller central hyperplane sections necessarily have smaller volume. The answer is affirmative for n less or equal to 4 and negative if n…
Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…
In this paper we solve several reverse isoperimetric problems in the class of $\lambda$-convex bodies, i.e., convex bodies whose curvature at each point of their boundary is bounded below by some $\lambda > 0$. We give an affirmative answer…
We investigate lattice energies for radially symmetric, spatially extended particles interacting via a radial potential and arranged on the sites of a two-dimensional Bravais lattice. We show the global minimality of the triangular lattice…
In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating-set problem, for a given set of objects in {the} plane as input, the objective is to choose a minimum number of…
We show that the infimum of the dual volume of the convex core of a convex co-compact hyperbolic $3$-manifold with incompressible boundary coincides with the infimum of the Riemannian volume of its convex core, as we vary the geometry by…
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…
In many areas of research it is interesting how lattices can be filled with particles that have no nearest neighbors, or they are in limited quantities. Examples may be found in statistical physics, chemistry, materials science, discrete…
In \cite{Sz17-2} we considered hyperball packings in $3$-dimensional hyperbolic space. We developed a decomposition algorithm that for each saturated hyperball packing provides a decomposition of $\HYP$ into truncated tetrahedra. In order…