Mean-value conjecture for well-conditioned polynomial tuples

Let XX be sufficiently large, and let f=(f1,,ft){\mathbf f}=(f_1,\ldots,f_t) be a well-conditioned tt-tuple of polynomials with integral coefficients, where deg(fj)=kj\deg(f_j)=k_j. Define

As,r(X;f)=g(α;X)2sdα,A_{s,r}(X;{\mathbf f})=\oint |{\mathfrak g}({\boldsymbol\alpha};X)|^{2s}\,{\rm d}{\boldsymbol\alpha},

where

g(α;X)=hXr1zXe(hj=1tfj(z)αj).{\mathfrak g}({\boldsymbol\alpha};X)=\sum_{|h|\leqslant X^r}\sum_{1\leqslant z\leqslant X}e\left(h\sum_{j=1}^t f_j(z)\alpha_j\right).

Equivalently, As,r(X;f)A_{s,r}(X;{\mathbf f}) counts the solutions of i=12shifj(zi)=0\sum_{i=1}^{2s}h_i f_j(z_i)=0 for 1jt1\leqslant j\leqslant t, with hiXr|h_i|\leqslant X^r and 1ziX1\leqslant z_i\leqslant X. Mean-value conjecture for well-conditioned polynomial tuples. For natural numbers rr, ss, and tt, one has

As,r(X;f)Xε(Xr(2s1)+1+X2s(r+1)trk1kt).A_{s,r}(X;{\mathbf f})\ll X^\varepsilon\left(X^{r(2s-1)+1}+X^{2s(r+1)-tr-k_1-\ldots-k_t}\right).

The first term accounts for diagonal solutions, while the second is the expected contribution from the remaining variables and equations. The theorem preceding this conjecture proves the first-term bound when t2s1t\geqslant2s-1; extending the estimate to larger ss is the speculative part and remains open.

Sources & referencesView supporting material

Primary source

Julia Brandes and Trevor D. Wooley, “Vinogradov systems with a slice off”, arXiv:1707.06047 (2017).

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.