A method is proposed for obtaining bounds for packings in metric spaces, the method being
based on the use of zonal spherical functions associated with a motion group of the space. …

… Hence, we are moved to consider fast heuristics and how closely the packings they produce
approach optimum packings. For this purpose we define the following class of packing …

… For ellipsoids, a lattice packing is just an affine transformation of a sphere packing… packing
has 0:7405. The next level of generality involves nonlattice periodic packings (lattice packings …

… As work on the classical sphere packing … sphere packing problems, but also the contemporary
ones such as blocking light rays, the holes in sphere packings, and finite sphere packings. …

… In these chapters we survey what is presently known about the packing, kissing number,
covering and quantizing problems. There are sections on quadratic forms and their classification…

… The packing number Dλ(v, k, t) is the maximum number of blocks in any t-(v, k, λ) packing.
A t-(v, k, λ) … A cyclic packing with maximum possible number of blocks is optimal. 40.39 …

… The distribution of threshold packing fractions narrows, and its peak approaches random
close packing as the system size increases. For packing fractions within the peak, there is no …

… packings and packings with incorporated polar groups. We can also distinguish CN packings
or fluorinated packings. … includes over 100 commercially available packings. The ability of …

… evidence that our packings for convex … packing of spheres and the densest known packing
of octahedra which we conjecture to be optimal 34 meet at a single point the same packing …

… packing is not then a lattice packing. For m = 7, however, a lattice packing is obtained if we
begin with the lattice packing … packings can be obtained similarly for m > 7 by using the lattice …