90 citations · 119 across the 9 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DM2012
Sampling-based proofs of almost-periodicity results and algorithmic applications
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani +1
We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has h…
math.NT2012★ 8 cited
Polynomial configurations in the primes
Thai Hoang Le, Julia Wolf
The Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomia…