English

Random Van der Waerden Theorem

Combinatorics 2021-07-13 v2

Abstract

In this paper we prove the Random Van der Waerden Theorem: For q1q2qr3Nq_1 \geq q_2 \geq \dotsb \geq q_r \geq 3 \in \mathbb{N} there exist c,C>0c,C >0 such that limnP([n]p(q1,,qr))={1if pCnq2q1(q21),0if pcnq2q1(q21), \lim_{n \to \infty} \mathbb{P}([n]_p \rightarrow (q_1,\dotsc, q_r)) = \begin{cases} 1 & \text{if } p \geq C \cdot n^{-\frac{q_2}{q_1(q_2-1)}}, 0 & \text{if } p \leq c \cdot n^{-\frac{q_2}{q_1(q_2-1)}}, \end{cases} extending the results of R\"odl and Ruci\'nski for the symmetric case qi=qq_i = q. The proof for the 1-statement is based on the Hypergraph Container Method by Balogh, Morris and Samotij and Saxton and Thomason. The proof for the 0-statement is an extension of R\"odl and Ruci\'nski's argument for the symmetric case.

Keywords

Cite

@article{arxiv.2006.05412,
  title  = {Random Van der Waerden Theorem},
  author = {Ohad Zohar},
  journal= {arXiv preprint arXiv:2006.05412},
  year   = {2021}
}

Comments

29 pages

R2 v1 2026-06-23T16:11:12.111Z