相关论文: The Antipode Construction for Sphere Packings

Many of the mathematical models used in quasicrystal physics are based on tilings of the plane or space obtained by using strip projection method in a superspace of dimension four, five or six. We present some mathematical results which…

We extend our theory of amorphous packings of hard spheres to binary mixtures and more generally to multicomponent systems. The theory is based on the assumption that amorphous packings produced by typical experimental or numerical…

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 revisit the densest binary sphere packings (DBSP) under the periodic boundary conditions and present an updated phase diagram, including newly found 12 putative densest structures over the $x - \alpha$ plane, where $x$ is the relative…

We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a truncation radius for the three-point function. As a result, we…

At sufficiently low temperatures and high densities, repulsive spherical particles in two-dimensions (2d) form close-packed structures with six-fold symmetry. By contrast, when the interparticle interaction has an attractive anisotropic…

In this paper we study the hard sphere packing problem in the Hamming space by the cavity method. We show that both the replica symmetric and the replica symmetry breaking approximations give maximum rates of packing that are asymptotically…

We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…

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 densest local packings of N three-dimensional identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained for selected values of N up to N = 1054. In the predecessor to this paper…

Motivated by a recently identified severe discrepancy between a static and a dynamic theory of glasses, we numerically investigate the behavior of dense hard spheres in spatial dimensions 3 to 12. Our results are consistent with the static…

We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asymptotical fundamental limits of the problem - the minimal…

Spherical $t$-designs on $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ provide $N$ nodes for an equal weight numerical integration rule which is exact for all spherical polynomials of degree at most $t$. This paper considers the generation of…

Spherical $t$-designs are finite point sets on the unit sphere that enable exact integration of polynomials of degree at most $t$ via equal-weight quadrature. This concept has recently been extended to spherical $t$-design curves by the use…

Lattice and special nonlattice multilevel constellations constructed from binary codes, such as Constructions A, C, and D, have relevant applications in Mathematics (sphere packing) and in Communication (multi-stage decoding and efficient…

In this paper using the concept of the extended Hamming code we give a construction for dense packing of points at distance at least one in such unit cubes which dimension are a power of two.

Data visualizations summarize high-dimensional distributions in two or three dimensions. Dimensionality reduction entails a loss of information, and what is preserved differs between methods. Existing methods preserve the local or the…

Orthogonal array, a classical and effective tool for collecting data, has been flourished with its applications in modern computer experiments and engineering statistics. Driven by the wide use of computer experiments with both qualitative…

Symbolic and graphical tools, such as Mathematica, enable precise visualization and analysis of void spaces in sphere packings. In the cubic close packing (CCP, or face-centred cubic packing; FCC) arrangement these voids can be partitioned…

This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…