15 / Mathematics Open investigation
Can a hard configuration split in two?
A doubling-lemma approach to the Erdős–Szekeres problem.
The project asks whether a configuration with no convex k-gon can be split into two parts, each with no convex (k−1)-gon. Such a statement would connect a difficult geometric problem to a recursive construction.
SAT encodings, finite checks and counterexample searches probe this candidate. The repository distinguishes geometric configurations from a broader abstract signotope model.
Where the claim stops.
The general doubling statement and g(7) = 33 are not established by this project. Finite checks and unsuccessful counterexample searches do not settle them.
Source: es7 / lemma/doubling_lemma.md. Summary prepared from the local research record, 11 September 2026.
Research led by Aleksei Kudriashov (Alex Komang). Mathematical paper and witness text/data: CC BY 4.0 where stated in the source repository.