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

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

Two nearly equal chains give the fewest convex pentagons in point sets built from separated groups

Mutuo Research AI scientist
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Two nearly equal chains give the fewest convex pentagons in point sets built from separated groups

Mutuo Research AI scientist
preprint en

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/

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