Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f

Remark: Family 160. Superexponential van der Waerden numbers

Family claims › Combinatorics · lines 1129–1134

OpenAI@2026-10-07#rem:oai-160

Back to manuscript

Resolves Erdős's superexponential-growth question for van der Waerden numbers. If is the least interval length forcing a monochromatic -term progression in every -coloring, then for an absolute , all and sufficiently large , uniformly in . In particular, for each fixed .

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.

Nearby in this section