On Vinogradov's mean value theorem: strongly diagonal behaviour via efficient congruencing (Q483370)

In this great paper the two experts on the field combine their forces pushing the limits of the method even further. In particular, they prove upper bounds for Vinogradov's mean value for a large range of parameter values. Their main tool is the ``efficient congruencing'' method developed by the second author (cf. [Ann. Math. (2) 175, No. 3, 1575--1627 (2012; Zbl 1267.11105); Duke Math. J. 162, No. 4, 673--730 (2013; Zbl 1312.11066)]). Let \(k\) and \(s\) be positive integers and denote by \(J_{s,k}(X)\) the number of integral solutions of the system of Diophantine equations \[ \sum_{i=1}^s(x_i^j-y_i^j)=0\quad(1\leq j\leq k) \] with \(1\leq x_i,y_i\leq X\) for \(1\leq i\leq s\). By considering the diagonal solutions \(x_i=y_i\) (\(1\leq i\leq s\)) we obtain the lower bound \[ J_{s,k}(X)\gg X^s+X^{2s-k(k+1)/2}. \] The main conjecture of Vinogradov's mean value theorem asserts that this is also almost the upper bound, meaning that for each \(\varepsilon>0\) one has \[ J_{s,k}(X)\ll X^\varepsilon\left(X^s+X^{2s-k(k+1)/2}\right). \] In the present paper the authors prove this main conjecture for \(1\leq s\leq \frac14(k+1)^2\) and \(k\geq4\). Moreover they improve bounds of the second author [Zbl 1267.11105] and [Zbl 1312.11066] in the range \[ \frac14(k+1)^2<s<k^2-1. \] These improvements have applications in the asymptotic formula for Waring's Problem.