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

  1. 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.

  2. 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

Sources

  1. Kurz’s original convex-hull conjecture
  2. The maximum area of the convex hull of a polyhex
  3. Pinned theorem, provenance and checking record
Publication history