A Probabilistic Threshold for Monochromatic Arithmetic Progressions
Aaron Robertson

TL;DR
This paper establishes a probabilistic threshold for the existence of monochromatic arithmetic progressions in r-colored intervals, identifying a critical interval length where such progressions almost surely appear or do not.
Contribution
It introduces a probabilistic threshold interval length, based on and r, for the appearance of monochromatic k-term arithmetic progressions in r-colored intervals.
Findings
Threshold interval length is approximately \, r^{k/2}.
Almost every r-coloring contains a monochromatic progression above this length.
Almost no r-coloring contains such a progression below this length.
Abstract
We show that is a threshold interval length where, under mild conditions, almost every -coloring of an interval of longer length contains a monochromatic -term arithmetic progression, while almost no -coloring of an interval of shorter length contains a monochromatic -term arithmetic progression.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Mathematical Dynamics and Fractals
