Hexagonal Tiling of the Plane
Abstract
Since the thesis of K. Reinhardt in 1918, it is well known that there are exactly three types of convex hexagons that can tile the plane. However, the proof of the fact is far from being complete. We prove this fact, under an assumption weaker than the convexity.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.