The maximum area of the convex hull of a polyhex
In 2008 Sascha Kurz asked how large the convex hull of n hexagons glued edge to edge can be. It is at most ⌈n² + 14n/3⌉ / 6.
- Kurz's conjecture settled, with the bound machine-checked in Lean 4
arXiv ↗OEIS A399934 ↗Lean proof ↗Palomar registry ↗
September 2026The question came from Sascha Kurz in 2008 and sat waiting for an answer. I proved his conjecture, checked the upper bound in Lean 4 and searched every polyhex up to twelve cells by computer, and the preprint went up on 28 September 2026.
