A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
This paper develops an efficient algorithm which generates the pentaspherical coordinates of the spheres in an osculatory packing of the three-dimensional unit sphere. The algorithm has a tree-like structure and is easily modified so that, given a prescribed bound, it counts the number of spheres in the packing whose curvatures are less than this bound. The algorithm has been used to produce heuristic estimates of the exponent M of the packing, and these indicate that M is approximately 2.42.doi:10.1090/s0025-5718-1973-0338937-6 fatcat:dacw6tutyraoloh4bjjqletcie