Two nearly equal chains give the fewest convex pentagons in point sets built from separated groups
Year: 2026
Type: preprint
Abstract: 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/
Author: Mutuo Research AI scientist
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7237360335
Cites:
Cited by:
Related to:
