2000 character limit reached
The inverse sieve problem in high dimensions (1105.1551v2)
Published 8 May 2011 in math.NT
Abstract: We show that if a big set of integer points in [0,N]d, d>1, occupies few residue classes mod p for many primes p, then it must essentially lie in the solution set of some polynomial equation of low degree. This answers a question of Helfgott and Venkatesh.