Minimum numbers of convex polygons on twelve through fourteen points
We prove that the minimum number of convex polygons determined by twelve, thirteen and fourteen planar points in general position is 408, 570 and 780, respectively. Up to relabeling and reflection, five order types attain the thirteen-point minimum and one attains the fourteen-point minimum. We also prove that exterior twin pairs cannot occur in minimizers at any size n ≥ 4. The general Erdős–Hammer limit in Erdős Problem #838 remains open. This deposit contains the paper PDF. The source, enumeration, and verification materials are available on GitHub.
Authors
- Rohan Arun
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24388069
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint