相关论文: A Computer Approach to Determine the Densest Trans…

Several conditions are given when a packing of equal disks in a torus is locally maximally dense, where the torus is defined as the quotient of the plane by a two-dimensional lattice. Conjectures are presented that claim that the density of…

This work studies rearrangement problems involving the sorting of robots or objects in stack-like containers, which can be accessed only from one side. Two scenarios are considered: one where every robot or object needs to reach a…

Although the concept of random close packing with an almost universal packing fraction of ~ 0.64 for hard spheres was introduced more than half a century ago, there are still ongoing debates. The main difficulty in searching the densest…

The packing density of the regular cross-polytope in Euclidean $n$-space is unknown except in dimensions $2$ and $4$ where it is 1. The only non-trivial upper bound is due to Gravel, Elser, and Kallus (2011) who proved that for $n=3$ the…

In this paper we study the problem of maximizing the distance to a given point $C_0$ over a polytope $\mathcal{P}$. Assuming that the polytope is circumscribed by a known ball we construct an intersection of balls which preserves the…

We investigate the problem of packing identical hard objects on regular lattices in d dimensions. Restricting configuration space to parallel alignment of the objects, we study the densest packing at a given aspect ratio X. For rectangles…

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

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

Since antiquity, the packing of convex shapes has been of great interest to many scientists and mathematicians. Recently, particular interest has been given to packings of three-dimensional tetrahedra. Dense packings of both crystalline and…

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

In \cite{Sz11} we have generalized the notion of the simplicial density function for horoballs in the extended hyperbolic space $\bar{\mathbf{H}}^n, ~(n \ge 2)$, where we have allowed {\it congruent horoballs in different types} centered at…

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…

This paper tackles the problem of finding optimal variable-height transport packaging. The goal is to reduce the empty space left in a box when shipping goods to customers, thereby saving on filler and reducing waste. We cast this problem…

We propose a unifying setting for dealing with monodromically atypical intersections that goes beyond the usual Zilber-Pink conjecture. In particular we obtain a new proof of finiteness of the maximal atypical orbit closures in each stratum…

We investigate the problem of computing a minimal-volume container for the non-overlapping packing of a given set of three-dimensional convex objects. Already the simplest versions of the problem are NP-hard so that we cannot expect to find…

All hard, convex shapes are conjectured by Ulam to pack more densely than spheres, which have a maximum packing fraction of {\phi} = {\pi}/\sqrt18 ~ 0.7405. For many shapes, simple lattice packings easily surpass this packing fraction. For…

The nucleation kinetics of the rotator phase in hard cuboctahedra, truncated octahedra, and rhombic dodecahedra is simulated via a combination of Forward Flux Sampling and Umbrella Sampling. For comparable degree of supersaturation, the…

Cutting and packing problems are present in many, at first glance unconnected, areas, therefore it's beneficial to have a good understanding of their underlying structure, to select proper techniques for finding solutions. Cutting and…

In this paper, a result of Albert, Atkinson, Handley, Holton, and Stromquist [Electron. J. Combin. 9 (2002), #R5] which characterizes the optimal packing behavior of the pattern 1243 is generalized in two directions. The packing densities…

In this article we obtain linear programming bounds for the maximal sphere packing density of commutative spaces. A special case of our results solves a conjecture by Cohn and Zhao on linear programming bounds for sphere packings in…