Related papers: Vinogradov's mean value theorem via efficient cong…

We develop a multigrade enhancement of the efficient congruencing method to estimate Vinogradov's integral of degree $k$ for moments of order $2s$, thereby obtaining near-optimal estimates for $\tfrac{5}{8}k^2<s\le k^2-k+1$. There are…

We apply the efficient congruencing method to estimate Vinogradov's integral for moments of order 2s, with 1<=s<=k^2-1. Thereby, we show that quasi-diagonal behaviour holds when s=o(k^2), we obtain near-optimal estimates for…

We apply a variant of the multigrade efficient congruencing method to estimate Vinogradov's integral of degree $3$ for moments of order $2s$, establishing strongly diagonal behaviour for $1\le s\le 6$. Consequently, the main conjecture is…

We enhance the efficient congruencing method for estimating Vinogradov's integral for moments of order $2s$, with $1\le s\le k^2-1$. In this way, we prove the main conjecture for such even moments when $1\le s\le \tfrac{1}{4}(k+1)^2$,…

We apply multigrade efficient congruencing to estimate Vinogradov's integral of degree $k$ for moments of order $2s$, establishing strongly diagonal behaviour for $1\le s\le \frac{1}{2}k(k+1)-\frac{1}{3}k+o(k)$. In particular, as…

When k > 1 and s is sufficiently large in terms of k, we derive an explicit multi-term asymptotic expansion for the number of representations of a large natural number as the sum of s positive integral k-th powers.

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1,…

We apply recent progress on Vinogradov's mean value theorem to improve bounds for the function $H(k)$ in the Waring-Goldbach problem. We obtain new results for all exponents $k \ge 7$, and in particular establish that for large $k$ one has…

In this paper, we obtain an asymptotic formula for the number of integral solutions to a system of diagonal equations. We obtain an asymptotic formula for the number of solutions with variables restricted to smooth numbers as well. We…

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

We describe mean value estimates for exponential sums of degree exceeding 2 that approach those conjectured to be best possible. The vehicle for this recent progress is the efficient congruencing method, which iteratively exploits the…

Let $\mu_1, \ldots, \mu_s$ be real numbers, with $\mu_1$ irrational. We investigate sums of shifted $k$th powers $\mathfrak{F}(x_1, \ldots, x_s) = (x_1 - \mu_1)^k + \ldots + (x_s - \mu_s)^k$. For $k \ge 4$, we bound the number of variables…

Recent progress on Vinogradov's mean value theorem has resulted in improved estimates for exponential sums of Weyl type. We apply these new estimates to obtain sharper bounds for the function $H(k)$ in the Waring--Goldbach problem. We…

We give a slight refinement to the process by which estimates for exponential sums are extracted from bounds for Vinogradov's mean value. Coupling this with the recent works of Wooley, and of Bourgain, Demeter and Guth, providing optimal…

We give results on the asymptotic in Waring's problem over function fields that are stronger than the results obtained over the integers using the main conjecture in Vinogradov's mean value theorem. Similar estimates apply to Manin's…

We apply a nested variant of multigrade efficient congruencing to estimate mean values related to that of Vinogradov. We show that when $\varphi_j\in \mathbb Z[t]$ $(1\le j\le k)$ is a system of polynomials with non-vanishing Wronskian, and…

When $k$ and $s$ are natural numbers and $\mathbf h\in \mathbb Z^k$, denote by $J_{s,k}(X;\mathbf h)$ the number of integral solutions of the system \[ \sum_{i=1}^s(x_i^j-y_i^j)=h_j\quad (1\le j\le k), \] with $1\le x_i,y_i\le X$. When…

This is an expository paper, giving a simplified proof of the cubic case of the main conjecture for Vinogradov's mean value theorem.

We combine Wooley's efficient congruencing method with earlier work of Vinogradov and Hua to get effective bounds on Vinogradov's mean value theorem.

We present a hybrid approach to bounding exponential sums over kth powers via Vinogradov's mean value theorem, and derive estimates of utility for exponents k of intermediate size.