The *easier Waring problem* asks for the least number $v=v(k)$ such that every every integer is a sum of $v$ $k$'th powers *with signs*, i.e. every $n\in \mathbb{N}$ is of the form $$n=x\_1^k\pm x\_2^k\pm\dotsb\pm x\_v^k.$$


The problem is ``easier'' because unlike the usual Waring problem (without the signs) the existence of $v(k)$ is easy --- the bound $v(k)\leq 2^{k-1}+\tfrac{1}{2}k!$ follows from the repeated differencing. Of course, the upper bounds on the usual Waring problem apply, and so fact $v(k)=O(k\log k)$.


All the lower bounds on $v(k)$ I have seen come from the congruence considerations. For example, $v(3)\geq 4$ because we need at least four terms modulo $9$. However, if we discard the congruential obstacles is there a non-trivial lower bound? To put bluntly my question is



> 
> Is there $k$ large enough so that the set $\{x\_1^k\pm x\_2^k\pm x\_3^k\pm x\_4^k\pm x\_5^k\}$has zero density?
> 
> 
> 



Lower bounds on the easier Waring problem
As far as I am aware, nothing unconditional is known. The difficulty is that one has no obvious constraint on the size of the variables, so that the $x\_i$ could be arbitrarily large in terms of $n$ in a solution. The difficulty of ruling out solutions (when congruence conditions do not rule out solubility) is related to proving insolubility of generalised Fermat equations.


However, there is a conditional approach assuming the truth of the generalised ABC Conjecture (or, as Pomerance describes it, the Alphabet Conjecture). Let's stick with the general situation with $v$ summands. Generalised ABC asserts that in any solution of
$a\_1+\ldots +a\_s=0$ in which there are no vanishing subsums, one has
$\underset{1\le i\le s}{\max}|a\_i|\ll\_{s,\epsilon} \left( \prod\_{p|a\_1\ldots a\_s}p\right)^{(s-1)(s-2)/2+\epsilon}.$ There is disagreement about the specific exponent, but this does not matter so much in the conclusion (see a 1986 paper of Brownawell and Masser for a function field version, and I discuss this in a 1994 paper on Quasi-diagonal behaviour). The vanishing subsums in your equation $\pm x\_1^k+\ldots +\pm x\_v^k=n$ make life easier (treat them separately, and more powerful estimates are possible), so for simplicity suppose that the representations all have no vanishing subsums. Then one obtains $|x\_i|^k\ll |nx\_1\ldots x\_v|^{v(v-1)/2+\epsilon}$. Provided that $k>v^2(v-1)/2$, it follows that $\max |x\_i|\ll |n|^{\alpha+\epsilon}$, where $\alpha=v(v-1)/(2k-v^2(v-1))$. OK ... so far so good. What we have shown thus far is that the variables in a representation are bounded by $|n|^{\alpha +\epsilon}$. The total number of variables available to represent the integers $n$ between $N/2$ and $N$ is consequently no larger than a quantity which is $\ll (N^{\alpha+\epsilon})^v$ (there were $v$ variables). Whenever $v(\alpha+\epsilon)<1$, therefore, the set of integers represented must have zero density. If I have not made any computational errors along the way, this leads us to the conclusion that whenever $k>v^2(v-1)$, then the density of integers represented in the easier Waring problem will be zero. (But remember that this is all conditional on the Generalised ABC Conjecture.) For the specific problem with $v=5$, it looks as if $k>100$ conjecturally does the trick (though smaller $k$ should surely also work).


