Maximum convex-hull area of a polyhex
A polyhex is a finite set of cells in the regular hexagonal tiling connected through shared edges. For a fixed number of cells, how large can the area of the smallest convex set containing them be?
Why it matters and what counts as progress
Why it matters: The connected cells can leave large empty regions inside their convex hull. The bound measures how much empty area a connected shape can enclose under convexification.
What counts as progress: Prove an upper bound in units of one cell and exhibit a connected shape attaining it. Classifying all extremizers is a separate question.
How the problem developed
- 2008 · Kurz’s area conjecture [1]
Sascha Kurz Sascha Kurz proposed an upper bound for the convex-hull area of a connected set of n regular hexagonal cells.
- 23 Sept 2026 · Sharp upper bound and construction [2]
Pragyaan Gaur with AI assistance Pragyaan Gaur published an upper bound and a matching shape for every n. Principia Math supplied the initial upper-bound argument, and Gaur replaced two proof steps.
AI contribution
The maximum area of the convex hull of a polyhex
For n edge-connected cells in the regular hexagonal tiling, the convex-hull area is at most one sixth of the ceiling of , measured in units of one cell. The paper gives a matching construction for every n.
Sources
Publication history
Daily emails by default, only when there’s an update.