The inverse Sieve problem in high dimensions
We show that if a big set of integer points S ⊆ [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. © 2012.
| Autor principal: | |
|---|---|
| Formato: | JOUR |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_00127094_v161_n10_p2001_Walsh |
| Aporte de: |
| Sumario: | We show that if a big set of integer points S ⊆ [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. © 2012. |
|---|