Abstract
We show that the number of disjointed families needed in the Besicovitch Covering Theorem equals the number of unit spheres that can be packed into a ball of radius five, with one at the center, and get estimates on this number.
Similar content being viewed by others
References
Bateman, P., and Erdös, P. Geometrical extrema suggested by a lemma of Besicovitch.Amer. Math. Monthly 58, 306–314 (1951).
Besicovitch, A. S. A general form of the covering principle and relative differentiation of additive functions.Proc. Cambridge Phil. Soc. 41, 103–110 (1945).
Brakke, K. A. The Surface Evolver.Experimental Mathematics 1, 141–165 (1992).
Conway, J., and Sloane, N. J. A.Sphere Packings, Lattices and Groups. Springer-Verlag, Berlin, 1988.
Erdös, P., Godsil, C., Krantz, S. G., and Parsons, T. D. Intersection graphs for families of balls in ℝN.Eur. J. Combinatorics 9, 501–506 (1988).
Federer, H.Geometric Measure Theory. Springer-Verlag, Berlin, 1969.
Füredi, Z., and Loeb, P. On the best constant for the Besicovitch covering theorem. Preprint, 1992.
Hardin, R. H., Sloane, N. J. A., and Smith, W. D.Spherical Codes. Unpublished manuscript.
Kabatyanskii, G. A., and Levenshtein, V. I. Bounds for packings on a sphere and in space.Problems of Information Transmission 95, 148–158 (1974).
Krantz, S. G., and Parsons, T. D. Antisocial subcoverings of self-centered coverings.Am. Math. Monthly 93, 45–48 (1986).
Levenshtein, V. I. On bounds for packings inn-dimensional euclidean space.Soviet Math. Doklady 20, 417–421 (1979).
Loeb, P. On the Besicovitch covering theorem.SUT J. Math. (Tokyo) 25, 51–55 (1989).
Rankin, R. A. The closest packing of spherical caps inn dimensions.Proc. Glasgow Math. Assoc. 2, 139–144 (1955).
Reifenberg, E. R. A problem on circles.Math. Gazette 32, 290–292 (1948).
Robinson, R. M. Arrangement of 24 points on a sphere.Math. Ann. 144, 17–48 (1961).
Sidel’nikov, V. M. New bounds for densest packings of spheres inn-dimensional euclidean space.Mat. Sbornik 95, 148–158 (1974).
Smith, W. D. Studies in computational geometry motivated by mesh generation. Ph.D. thesis, Princeton University, September 1988.
Sullivan, J. M. A crystalline approximation theorem for hypersurfaces. Ph.D. thesis, Princeton University, September 1990. Also available as Research Report GCG 22 from the Geometry Center, 1300 South Second Street 500, Minneapolis, MN 55454.
Wolfram, S.Mathematica: A System for Doing Mathematics by Computer, Second edition. Addison-Wesley, Redwood City, 1991.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sullivan, J.M. Sphere packings give an explicit bound for the Besicovitch Covering Theorem. J Geom Anal 4, 219–231 (1994). https://doi.org/10.1007/BF02921548
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02921548