Gaussian width bounds with applications to arithmetic progressions in random settings
From MaRDI portal
Publication:5854232
Abstract: Motivated by problems on random differences in Szemer'{e}di's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width of point sets that are formed by the image of the -dimensional Boolean hypercube under a mapping , where each coordinate is a constant-degree multilinear polynomial with 0-1 coefficients. We show the following applications of our bounds. Let be the random subset of containing each element independently with probability . A set is -intersective if any dense subset of contains a proper -term arithmetic progression with common difference in . Our main result implies that is -intersective with probability provided for . This gives a polynomial improvement for all of a previous bound due to Frantzikinakis, Lesigne and Wierdl, and reproves more directly the same improvement shown recently by the authors and Dvir. Let be the number of -term arithmetic progressions in and consider the large deviation rate . We give quadratic improvements of the best-known range of for which a highly precise estimate of due to Bhattacharya, Ganguly, Shao and Zhao is valid for all odd . We also discuss connections with error correcting codes (locally decodable codes) and the Banach-space notion of type for injective tensor products of -spaces.
Recommendations
Cited in
(10)- Replica symmetry in upper tails of mean-field hypergraphs
- High-entropy dual functions over finite fields and locally decodable codes
- Subspaces of tensors with high analytic rank
- Upper tails via high moments and entropic stability
- Bivariate fluctuations for the number of arithmetic progressions in random sets
- Upper tail large deviations for arithmetic progressions in a random set
- Deviation probabilities for arithmetic progressions and other regular discrete structures
- On the upper tail problem for random hypergraphs
- On the threshold for Szemerédi's theorem with random differences
- Multiple correlation sequences not approximable by nilsequences
This page was built for publication: Gaussian width bounds with applications to arithmetic progressions in random settings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854232)