Number of arithmetic progressions in dense random subsets of \(\mathbb{Z}/n\mathbb{Z}\)
From MaRDI portal
Publication:2055283
DOI10.1007/s11856-021-2180-7zbMath1503.11016arXiv1907.11807OpenAlexW3193954814MaRDI QIDQ2055283
Ashwin Sah, Ross Berkowitz, Mehtaab Sawhney
Publication date: 1 December 2021
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.11807
Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Arithmetic progressions (11B25)
Related Items (2)
Normal limiting distributions for systems of linear equations in random sets ⋮ Local limit theorems for subgraph counts
Cites Work
- Upper tails for arithmetic progressions in random subsets
- Anti-concentration for subgraph counts in random graphs
- Bivariate fluctuations for the number of arithmetic progressions in random sets
- The lower tail: Poisson approximation revisited
- On Stein’s method for multivariate normal approximation
- Upper Tail Large Deviations for Arithmetic Progressions in a Random Set
- Analysis of Boolean Functions
- A local central limit theorem for triangles in a random graph
This page was built for publication: Number of arithmetic progressions in dense random subsets of \(\mathbb{Z}/n\mathbb{Z}\)