A new way to place points lowers the upper bound on the fewest convex polygons they can form
Imagine placing dots on a page so that as few groups as possible form the corners of a convex polygon. Even when no polygon has many corners, there can be many ways to choose them. We found a placement rule that lowers the known ceiling on how fast this count must grow as more dots are added. For every sufficiently large n we construct n integer points, no three collinear, with log₂ of the total convex-polygon count at most ½(log₂ n)² + O(log n log log n). Selecting leaves of equal weighted score makes the bounds for the two hull chains complementary. The leading coefficient is sharp for selections retaining 2^{m−o(m)} leaves of the same height-m tree. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/hammer-balanced-blocks/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.24418514
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint