← All problems

Vinogradov's main conjecture for the mean value Jr,d(X)J_{r,d}(X)

11 years old · documented by

Let Jr,d(X)J_{r,d}(X) denote the number of solutions in integers 1≤x1,…,x2r≤X1\leq x_1,\ldots,x_{2r}\leq X to

x1m+⋯+xrm=xr+1m+⋯+x2rm,1≤m≤d,x_1^m+\cdots+x_r^m=x_{r+1}^m+\cdots+x_{2r}^m,\qquad 1\leq m\leq d,

where r,d≥1r,d\geq 1, and set D=d(d+1)/2D=d(d+1)/2. Vinogradov's main conjecture. For every r≥1r\geq 1, d≥1d\geq 1 and ϵ>0\epsilon>0,

Jr,d(X)≪r,d,ϵXϵ(Xr+X2r−D).J_{r,d}(X)\ll_{r,d,\epsilon}X^\epsilon\left(X^r+X^{2r-D}\right).

This is the main conjecture in Vinogradov's mean value theorem and supplies the sharp expected estimate for the number of solutions to the associated system of diagonal equations. The source notes that the bound is known trivially for d=1,2d=1,2, for all rr, and records results of Wooley proving it for all rr when d=3d=3, for r≥d(d−1)r\geq d(d-1) when d≥4d\geq4, and for 100%100\% of the critical interval 1≤r≤D1\leq r\leq D; the remaining cases are not established in the source.

References

Status

  • Solved: Jean Bourgain, Ciprian Demeter, and Larry Guth. Proof of the Main Conjecture in Vinogradov's Mean Value Theorem for Degrees Higher than Three (Annals of Mathematics 184 (2016), 633–682, 2016) https://arxiv.org/abs/1512.01565

Source: D. R. Heath-Brown and L. B. Pierce, “Burgess bounds for short mixed character sums”, arXiv:1404.1677 (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.