Some algorithms arising in the proof of the Kepler conjecture

Details Some algorithms arising in the proof of the Kepler conjecture Some algorithms arising in the proof of the Kepler conjecture

2002-05-19

arxiv.org/abs/math/0205209v1

Mathematics

Metric Geometry

14 pages, 5 figures

Scientific paper

By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones would have been better suited. This article gives a series of nonlinear optimization algorithms and shows how a systematic application of these algorithms would bring substantial simplifications to the original proof. This article includes a discussion of quantifier elimination, linear assembly problems, automated inequality proving, and plane graph generation in the context of discrete geometry.

Affiliated with

Also associated with

No associations

Rating

Some algorithms arising in the proof of the Kepler conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some algorithms arising in the proof of the Kepler conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some algorithms arising in the proof of the Kepler conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-242525