Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Discrete & Computational Geometry
  3. Article
Guest Editors' Foreword
Download PDF
Download PDF
  • Published: July 2006

Guest Editors' Foreword

  • Gabor Fejes Toth1 &
  • Jeffrey C. Lagaria2 

Discrete & Computational Geometry volume 36, pages 1–3 (2006)Cite this article

  • 213 Accesses

  • 14 Citations

  • Metrics details

Abstract

This issue of Discrete & Computational Geometry contains the detailed proof by T. Hales and S.P. Ferguson of the Kepler conjecture that the densest packing of three-dimensional Euclidean space by equal spheres is attained by "cannonball" packing. This is a landmark result. This conjecture, formulated by Kepler in 1611, was stated in Hilbert's formulation of his 18th problem [8]. The proof consists of mathematical arguments and a massive computer verification of many inequalities.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

Author information

Authors and Affiliations

  1. Hungarian Academy of Sciences, Hungary

    Gabor Fejes Toth

  2. University of Michigan, USA

    Jeffrey C. Lagaria

Authors
  1. Gabor Fejes Toth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeffrey C. Lagaria
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Toth, G., Lagaria, J. Guest Editors' Foreword. Discrete Comput Geom 36, 1–3 (2006). https://doi.org/10.1007/s00454-005-1209-8

Download citation

  • Issue Date: July 2006

  • DOI: https://doi.org/10.1007/s00454-005-1209-8

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature