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

September 2026. Section: Maths.

Paper: [The maximum area of the convex hull of a polyhex](https://arxiv.org/abs/2609.30310)

## Results

- Kurz's conjecture settled, with the bound machine-checked in Lean 4

## Story

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

## Links

- [Project](https://arxiv.org/abs/2609.30310)
- [OEIS A399934](https://oeis.org/A399934)
- [Lean proof](https://github.com/pragyaangaur/Polyhex-Hull)
- [Palomar registry](https://palomar-registry.org/entry?id=PALOMAR-2026-10-27-000022&version=1)

## See also

- [Hyperbolic polyplets](https://pragyaangaur.dev/work/polyplets/index.md)
- [Cauchy-Schwarz for real powers](https://pragyaangaur.dev/work/cauchy/index.md)
- [TriKing](https://pragyaangaur.dev/work/triking/index.md)

By [Pragyaan Gaur](https://pragyaangaur.dev/). The full index is at https://pragyaangaur.dev/llms.txt and https://pragyaangaur.dev/index.json.
