| dc.creator | Walsh, Miguel Nicolás | |
| dc.date.accessioned | 2019-01-21T17:25:15Z | |
| dc.date.accessioned | 2022-10-15T03:51:34Z | |
| dc.date.available | 2019-01-21T17:25:15Z | |
| dc.date.available | 2022-10-15T03:51:34Z | |
| dc.date.created | 2019-01-21T17:25:15Z | |
| dc.date.issued | 2012-07 | |
| dc.identifier | Walsh, Miguel Nicolás; The inverse Sieve problem in high dimensions; Duke University Press; Duke Mathematical Journal; 161; 10; 7-2012; 2001-2022 | |
| dc.identifier | 0012-7094 | |
| dc.identifier | http://hdl.handle.net/11336/68296 | |
| dc.identifier | CONICET Digital | |
| dc.identifier | CONICET | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/4342188 | |
| dc.description.abstract | 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. | |
| dc.language | eng | |
| dc.publisher | Duke University Press | |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/https://projecteuclid.org/euclid.dmj/1340801630 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1215/00127094-1645788 | |
| dc.rights | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
| dc.rights | info:eu-repo/semantics/restrictedAccess | |
| dc.subject | Sieve theory | |
| dc.subject | Arithmetic Combinatorics | |
| dc.subject | Inverse sieve problem | |
| dc.subject | Polynomial method | |
| dc.title | The inverse Sieve problem in high dimensions | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
