相关论文: Optimal Packing Behavior of some 2-block Patterns

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 problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…

We study the properties of 2D fibre clusters and networks formed by deposition processes. We first examine the growth and scaling properties of single clusters. We then consider a network of such clusters, whose spatial distribution obeys…

This is the sixth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

In 2008, Schmidt and Tuller stated a conjecture concerning optimal packing and covering of integers by translates of a given three-point set. In this note, we confirm their conjecture and relate it to several other problems in…

The structure of the densest crystal packings is determined for a variety of concave shapes in 2D constructed by the overlap of two or three disks. The maximum contact number per particle pair is defined and proposed as a useful means of…

We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…

We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…

Suppose one has a collection of disks of various sizes with disjoint interiors, a packing in the plane, and suppose the ratio of the smallest radius divided by the largest radius lies between $1$ and $q$. In his 1964 book Regular Figures…

We study pattern densities in binary sequences, finding optimal limit sequences with fixed pattern densities.

We have found a way to analyze Edwards' density of states for static granular packings in the special case of round, rigid, frictionless grains assuming constant coordination number. It obtains the most entropic density of single grain…

We prove that for all fixed $p > 2$, the translative packing density of unit $\ell_p$-balls in $\mathbb{R}^n$ is at most $2^{(\gamma_p + o(1))n}$ with $\gamma_p < - 1/p$. This is the first exponential improvement in high dimensions since…

The article presents the mathematical sequences describing circle packing densities in four different geometric configurations involving a hexagonal lattice based equal circle packing in the Euclidian plane. The calculated sequences take…

Dense polyhedron packings are useful models of a variety of condensed matter and biological systems and have intrigued scientists mathematicians for centuries. Recently, organizing principles for the types of structures associated with the…

In this paper we prove that the optimal lattice packing of the Minkowski, Davis, and Chebyshev-Cohn balls is realized with respect to the sublattices of index two of the critical lattices of corresponding balls

In $n$-dimensional hyperbolic space $\mathbf{H}^n$ $(n\ge2)$ there are $3$-types of spheres (balls): the sphere, horosphere and hypersphere. If $n=2,3$ we know an universal upper bound of the ball packing densities, where each ball volume…

A new locally averaged density for sphere packing in R^3 is defined by a proper combination of the local cell (Voronoi cell) and Delaunay decompositions (\S 1.2.2), using only a single layer of surrounding spheres. Local packings attaining…

We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…

Chase-like decoding algorithms are a popular choice for soft-input decoding of algebraic codes. In this paper, we evaluate the performance of different test pattern sets using three methods. For test pattern sets with a certain structure…