← All problems

The inverse large sieve conjecture

12 years old · traced to

Let X⊂ZX\subset\mathbb{Z} be a subset and let ϵ>0\epsilon>0 be real. Assume that, for every prime p≥ϵ−1p\geq\epsilon^{-1}, the reduction X(modp)X\pmod p occupies at most 0.99p0.99p residue classes. Inverse large sieve conjecture. Either ∣X∩[1,N]∣≪ϵNϵ|X\cap[1,N]|\ll_{\epsilon}N^{\epsilon} for all sufficiently large NN, or there exists a polynomial f(x)∈Q[x]f(x)\in\mathbb{Q}[x] of degree d≥2d\geq2 such that X∖f(Q)X\setminus f(\mathbb{Q}) is finite. The conjecture is intended as an infinitary inverse statement for the larger sieve: persistent omission of a positive proportion of residue classes should force either sparse growth or containment, up to finitely many exceptions, in a polynomial value set. The source immediately notes that this formulation is false, because examples can be formed by taking unions of value sets of several distinct polynomials.

References

Status

  • Refuted: Xuancheng Shao. Polynomial values modulo primes on average and sharpness of the larger sieve (arXiv (math.NT), 2014) https://arxiv.org/abs/1409.7160

Source: Xuancheng Shao, “Polynomial values modulo primes on average and sharpness of the larger sieve”, arXiv:1409.7160 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.