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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Minimum numbers of convex polygons on twelve through fourteen points

Rohan Arun
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Minimum numbers of convex polygons on twelve through fourteen points

Rohan Arun
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Minimum numbers of convex polygons on twelve through fourteen points — Rohan Arun · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS