Papers
Topics
Authors
Recent
Search
2000 character limit reached

The inverse sieve problem in high dimensions

Published 8 May 2011 in math.NT | (1105.1551v2)

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

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Miguel N. Walsh 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up