On the threshold for Szemerédi's theorem with random differences
From MaRDI portal
Publication:6635163
DOI10.37236/12415MaRDI QIDQ6635163
Publication date: 9 November 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random differences in Szemerédi's theorem and related results
- Locally decodable codes and the failure of cotype for projective tensor products
- Ruzsa's problem on sets of recurrence
- Threshold functions
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Multiple recurrence and convergence along the primes
- On sets of integers containing k elements in arithmetic progression
- Regularity Lemma for k-uniform hypergraphs
- Random sequences and pointwise convergence of multiple ergodic averages
- The counting lemma for regular k‐uniform hypergraphs
- An Introduction to Matrix Concentration Inequalities
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- Gaussian Width Bounds with Applications to Arithmetic Progressions in Random Settings
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Concentration of multivariate polynomials and its applications
- A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation
This page was built for publication: On the threshold for Szemerédi's theorem with random differences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635163)
