Solution-count conjecture for Vinogradov systems modulo
Solution-count conjecture for Vinogradov systems modulo
Let and define . For , let be the number of satisfying . Use for the least nonnegative representative of the difference's absolute value in the source's ring metric. Solution-count conjecture for Vinogradov systems modulo . For all there exists a constant such that
This conjecture is suggested by comparison with the Euclidean Jacobian estimate and would control the multiplicities in the discrete convolution argument; the source does not establish it.
Sources & referencesView supporting material
Primary source
Jonathan Hickman and James Wright, “The Fourier restriction and Kakeya problems over rings of integers modulo N”, arXiv:1801.03176 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.