Tame Plane Graphs
نویسندگان
چکیده
These theories present the verified enumeration of tame plane graphs as defined by Thomas C. Hales in his revised proof of the Kepler Conjecture. Compared with his original proof, the notion of tameness has become simpler, there are many more tame graphs, but much of the earlier verification [1] carries over. For more details see http:// code.google.com/p/flyspeck/ and the forthcoming book “Dense Sphere Packings: A Blueprint for Formal Proofs” by Hales.
منابع مشابه
Towards a Verified Enumeration of All Tame Plane Graphs
We contribute to the fully formal verification of Hales’ proof of the Kepler Conjecure by analyzing the enumeration of all tame plane graphs. We sketch a formalization of plane graphs, tameness and Hales’ enumeration procedure in Higher Order Logic. The correctness of the enumeration is partially verified (which uncovered a small mismatch between Hales’ definition of tameness and his enumeratio...
متن کاملFormalizing plane graph theory: towards a formalized proof of the Kepler conjecture
In 1998, Thomas Hales published a proof of the Kepler Conjecture, which states that the cubic close packing is the densest possible packing of equallysized spheres. The proof is by exhaustion on a set of 3050 plane graphs satisfying certain properties, called tame plane graphs. The enumeration of this set has been generated by a computer program, hence the completeness of this enumeration is es...
متن کاملFlyspeck I: Tame Graphs
We present a verified enumeration of tame graphs as defined in Hales’ proof of the Kepler Conjecture and confirm the completeness of Hales’ list of all tame graphs while reducing it from 5128 to 2771 graphs.
متن کاملSymmetry, Automorphisms, and Self-duality of Infinite Planar Graphs and Tilings
We consider tilings of the plane whose graphs are locally finite and 3-connected. We show that if the automorphism group of the graph has finitely many orbits, then there is an isomorphic tiling in either the Euclidean or hyperbolic plane such that the group of automorphisms acts as a group of isometries. We apply this fact to the classification of self-dual doubly periodic tilings via Coxeter’...
متن کاملFully Dynamic Cycle-Equivalence in Graphs
Two edges el and e2 of an undirected graph are cycle-equivalent iff all cycles that contain el also contain e2, i.e., iff el and e2 are a cut-edge pair. The cycle-equivalence classes of the control-flow graph are used in optimizing compilers to speed up ezasting control-flow and data-flow algorithms. While the cycle-equivalence classes can be computed in linear time, we present the first fully ...
متن کامل