Skip to main content

Selected Proofs on Sphere Packings

  • Chapter
  • First Online:
Classical Topics in Discrete Geometry

Part of the book series: CMS Books in Mathematics ((CMSBM))

  • 1086 Accesses

Abstract

Let B denote the unit ball centered at the origin o of \(\mathbb{E}^3\) and let \(\mathcal{P} : = {{\rm c}_1 + {\bf B}, {\rm c}_2 + {\bf c}, \cdots, {\rm c}_n + {\bf B}}\) denote the packing of n unit balls with centers c1; c2;… cn in \(\mathbb{E}^3\) having the largest number C(n) of touching pairs among all packings of n unit balls in \(\mathbb{E}^3\). (\(\mathcal{P}\) might not be uniquely determined up to congruence in which case \(\mathcal{P}\) stands for any of those extremal packings.) First, observe that Theorem 1.4.1 and Theorem 2.4.3 imply the following inequality in a straightforward way.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 59.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Károly Bezdek .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Bezdek, K. (2010). Selected Proofs on Sphere Packings. In: Classical Topics in Discrete Geometry. CMS Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-0600-7_7

Download citation

Publish with us

Policies and ethics