Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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.

Summary

We haven't generated a summary for this paper yet.