Two nearly equal chains give the fewest convex pentagons in point sets built from separated groups
How can you place dots so that as few groups of five as possible are the corners of a pentagon? Among arrangements built by repeatedly placing one group high above and to one side of another, two curved rows of nearly equal size do best. Anyone looking for a placement with still fewer pentagons must look outside this family. Among general-position planar sets built by recursive high-above/low-below splits with disjoint horizontal ranges, the two-chain construction minimizes convex pentagons for every n. Bounding each branch off the middle path by a single chain reduces the lower bound to a polynomial inequality certified by exact integer coefficients. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/separated-pentagon-minimum/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.24419127
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint