“Honeycomb conjecture”的意思、由来-开放百科全书

词条

Honeycomb conjecture

释义

Proof
History
See also
References

The honeycomb conjecture states that a regular hexagonal grid or honeycomb is the best way to divide a surface into regions of equal area with the least total perimeter. The conjecture was proven in 1999 by mathematician Thomas C. Hales.

Proof

Let Γ be a locally finite graph in R², consisting of smooth curves, and such that R² \\Γ has infinitely many bounded connected components, all of unit area. Let C be the union of these bounded components.{{r|DaCG}}

.

Equality is attained for the regular hexagonal tile.

History

The first record of the conjecture dates back to 36 BC, from Marcus Terentius Varro, but is often attributed to Pappus of Alexandria ({{circa|290|350}}). The conjecture was proven in 1999 by mathematician Thomas C. Hales, who mentions in his work that there is reason to believe that the conjecture may have been present in the minds of mathematicians before Varro.^[1]^[2]

It is also related to the densest circle packing of the plane, where every circle is tangent to 6 other circles which fill just over 90% of the area of the plane.

References

1. ^{{Cite web | last = Weisstein | first = Eric W. | publisher = MathWorld | title = Honeycomb Conjecture | url = http://mathworld.wolfram.com/HoneycombConjecture.html | accessdate = 27 Dec 2010}}
2. ^{{Cite journal | last = Hales | first = Thomas C. | authorlink = Thomas Callister Hales | title = The Honeycomb Conjecture | date = January 2001 | arxiv = math/9906042 | journal = Discrete and Computational Geometry | volume = 25 | issue = 1 | pages = 1–22 | doi=10.1007/s004540010071 | mr = 1797293}}

3 : Discrete geometry|Euclidean plane geometry|Conjectures that have been proved

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。

Proof

History

See also

References