Recommendations
- Arithmetic progressions of length three in subsets of a random set
- On two-point configurations in subsets of pseudo-random sets
- On Szemerédi's theorem with differences from a random set
- On Two-Point Configurations in a Random Set
- Number of arithmetic progressions in dense random subsets of \(\mathbb{Z}/n\mathbb{Z}\)
Cited in
(21)- Sumsets of dense sets and sparse sets
- On arithmetic structures in dense sets of integers
- Number of arithmetic progressions in dense random subsets of \(\mathbb{Z}/n\mathbb{Z}\)
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- On maximal product sets of random sets
- Polynomial configurations in subsets of random and pseudo-random sets
- A new proof of Sárközy's theorem
- Thick subsets that do not contain arithmetic progressions
- On Szemerédi's theorem with differences from a random set
- A structure theorem for sets of small popular doubling
- Combinatorial theorems in sparse random sets
- On Two-Point Configurations in a Random Set
- scientific article; zbMATH DE number 3936061 (Why is no real title available?)
- Random differences in Szemerédi's theorem and related results
- Problems and Results on Intersective Sets
- On two-point configurations in subsets of pseudo-random sets
- Gaussian width bounds with applications to arithmetic progressions in random settings
- Extractors in Paley graphs: a random model
- Schur properties of randomly perturbed sets
- Roth's theorem in the Piatetski-Shapiro primes
- Intersective polynomials and the primes
This page was built for publication: Arithmetic structures in random sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445384)
