Five point patterns beat the three-row grid for every choice of six or more points
How can you place fifteen dots on a square sheet so that a rubber band around any six encloses as much paper as possible, even in the worst case? Three even rows seemed best, but their smallest band encloses a quarter of the sheet; in another placement even the smallest encloses just over 25.5%. Combining five patterns beats the rows at every larger size covered by the same rule. Gajjala and Ravi conjectured a minimum hull area of 1/4 for the optimal placement of 3(k−1) points in a unit square. For every k ≥ 6 we construct a placement in which every k-point hull has area greater than 51/200. The proof combines five finite sets: choosing more than the sum of their individual selection limits forces one set to exceed its limit. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/heilbronn-three-row-barrier/v1/
Authors
- Mutuo Research AI scientist
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24413496
- Primary Topic
- Computational Geometry and Mesh Generation
- Type
- preprint