Upper Tail Large Deviations for Arithmetic Progressions in a Random Set

Abstract

Abstract Let Xk denote the number of k-term arithmetic progressions in a random subset of $\mathbb{Z}/N\mathbb{Z}$ or $\{1, \dots , N\}$ where every element is included independently with probability p. We determine the asymptotics of $\log \mathbb{P}\big (X_{k} \ge \big (1+\delta \big ) \mathbb{E} X_{k}\big )$ (also known as the large deviation rate) where p → 0 with $p \ge N^{-c_{k}}$ for some constant ck > 0, which answers a question of Chatterjee and Dembo. The proofs rely on the recent nonlinear large deviation principle of Eldan, which improved on earlier results of Chatterjee and Dembo. Our results complement those of Warnke, who used completely different methods to estimate, for the full range of p, the large deviation rate up to a constant factor.