Pages that link to "Item:Q616150"
From MaRDI portal
The following pages link to A probabilistic technique for finding almost-periods of convolutions (Q616150):
Displaying 6 items.
- Long arithmetic progressions in \(A+A+A\) with \(A\) a prime subset (Q415260) (← links)
- A quantitative version of the non-Abelian idempotent theorem (Q633235) (← links)
- On Roth's theorem on progressions (Q640798) (← links)
- Finite field models in arithmetic combinatorics -- ten years on (Q2512891) (← links)
- Extractors in Paley graphs: a random model (Q5964262) (← links)
- An Explicit Croot-Łaba-Sisask Lemma Free of Probabilistic Language (Q6497015) (← links)
