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

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

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

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

Jr,d(X)r,d,ϵXϵ(Xr+X2rD).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 rd(d1)r\geq d(d-1) when d4d\geq4, and for 100%100\% of the critical interval 1rD1\leq r\leq D; the remaining cases are not established in the source.

Sources & referencesView supporting material

Primary 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.