Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $12\leqslant b\leqslant 35$ and for every sufficiently large odd integer $N$, the equation \begin{equation*}
N=x^2+p_1^3+p_2^3+p_3^3+p_4^3+p_5^4+p_6^b \end{equation*} is solvable with $x$ being an almost-prime $\mathcal{P}_{r(b)}$ and the other variables primes, where $r(b)$ is defined in the Theorem. This result constitutes an improvement upon that of Lü and Mu.
In this paper, we exhibit an asymptotic formula for the number of representations of a large integer as a sum of a fixed power of Piatetski-Shapiro primes, thereby establishing a variant of Waring-Goldbach problem with primes from a sparse sequence.
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 \[H(k)\le (4k-2)\log k-(2\log 2-1)k-3.\]
In this paper, we investigate exceptional sets in the Waring-Goldbach problem for unlike powers. For example, estimates are obtained for sufficiently large integers below a parameter subject to the necessary local conditions that do not have a representation as the sum of a square of prime, a cube of prime and a sixth power of prime and a $k$-th power of prime. These results improve the recent result due to Brüdern in the order of magnitude. Furthermore, the method can be also applied to the similar estimates for the exceptional sets for Waring-Goldbach problem for unlike powers.
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 obtain new results for all exponents $k\ge 8$, and in particular establish that $H(k)\le (4k-2)\log k+k-7$ when $k$ is large, giving the first improvement on the classical result of Hua from the 1940s.
Let $s$, $\ell$ be two integers such that $2\le s\le \ell-1$, $\ell\ge 3$. We prove that a suitable asymptotic formula for the average number of representations of integers $n=\sum_{i=1}^{s} p_{i}^{\ell}$, where $p_i$, $i=1,\dotsc,s$, are prime numbers, holds in short intervals.
Let $Λ(n)$ be the von Mangoldt function, $x$ real and $2\leq y \leq x$. This paper improves the estimate on the exponential sum over primes in short intervals \[ S_k(x,y;α) = \sum_{x< n \leq x+y} Λ(n) e\left( n^k α\right) \] when $k\geq 3$ for $α$ in the minor arcs. And then combined with the Hardy--Littlewood circle method, this enables us to investigate the Waring--Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers, which improves the results in Wei and Wooley [12].
We prove an asymptotic formula for the Fourier transform of the arithmetic surface measure associated to the Waring--Goldbach problem and provide several applications, including bounds for discrete spherical maximal functions along the primes and distribution results such as ergodic theorems.
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for every sufficiently large even integer $N$, the equation \begin{equation*} N=x^2+p_1^3+p_2^3+p_3^3+p_4^3+p_5^3 \end{equation*} is solvable with $x$ being an almost-prime $\mathcal{P}_6$ and the other variables primes. This result constitutes an improvement upon that of Cai, who obtained the same conclusion, but with $\mathcal{P}_{36}$ in place of $\mathcal{P}_6$.
We use transference principle to show that whenever $s$ is suitably large depending on $k \geq 2$, every sufficiently large natural number $n$ satisfying some congruence conditions can be written in the form $n = p_1^k + \dots + p_s^k$, where $p_1, \dots, p_s \in [x-x^θ, x + x^θ]$ are primes, $x = (n/s)^{1/k}$ and $θ= 0.525 + ε$. We also improve known results for $θ$ when $k \geq 2$ and $s \geq k^2 + k + 1$. For example when $k \geq 4$ and $s \geq k^2 + k + 1$ we have $θ= 0.55 + ε$. All previously known results on the problem had $θ> 3/4$.
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan for ternary admissible exponent. Moreover, we use the refined admissible exponent to prove that, for $3\leqslant k\leqslant 14$ and for every sufficiently large even integer $n$, the following equation \begin{equation*} n=x^2+p_1^2+p_2^3+p_3^3+p_4^3+p_5^k \end{equation*} is solvable with $x$ being an almost-prime $\mathcal{P}_{r(k)}$ and the other variables primes, where $r(k)$ is defined in Theorem. This result constitutes a deepening…
We use Green's transference principle to show that any subset of the $d$th powers of primes with positive relative density contains nontrivial solutions to a translation-invariant linear equation in $d^2+1$ or more variables, with explicit quantitative bounds.
Let $k\geq2$ and $s$ be positive integers. Let $θ\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $θ>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions, can be written as $$ n=p_1^k+\cdots+p_s^k, $$ where $p_i(1\leq i\leq s)$ are primes in the interval $((\frac{n}{s})^{\frac{1}{k}}-n^{\fracθ{k}},(\frac{n}{s})^{\frac{1}{k}}+n^{\fracθ{k}}]$. The second result of this paper is to show that if $s>\frac{k(k+1)}{2}$ and $θ>0.55$, then almost all integers $n$, subject to certain congruence conditions, have above representat…
We examine the problem of writing every sufficiently large even number as the sum of two primes and at most $K$ powers of 2. We outline an approach that only just falls short of improving the current bounds on $K$. Finally, we improve the estimates in other Waring--Goldbach problems.
We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^θ$, as long as $θ\geq192/869$. An asymptotic formula for the number of such representations is established when $1/4<θ<1/3$.
We give an upper bound for the minimum $s$ with the property that every sufficiently large integer can be represented as the sum of $s$ positive $k$-th powers of integers represented as the sum of three positive cubes for the cases $2\leq k\leq 4.$
We investigate the asymptotic formula for the number of representations of a large positive integer as a sum of $k$-th powers of integers represented as the sums of three positive cubes, counted with multiplicities. We also obtain a lower bound for the number of representations when the sums of three cubes are counted without multiplicities.
We investigate the number of representations of a large positive integer as the sum of two squares, two positive integral cubes, and two sixth powers, showing that the anticipated asymptotic formula fails for at most O((log X)^3) positive integers not exceeding X.
By developing the method of Wooley on the quadratic Waring-Goldbach problem, we prove that all sufficiently large even integers can be expressed as a sum of four squares of primes and 46 powers of 2.
We investigate sums of mixed powers involving two squares, two cubes, and various higher powers, concentrating on situations inaccessible to the Hardy-Littlewood method.
We apply a method of Davenport to improve several estimates for slim exceptional sets associated with the asymptotic formula in Waring's problem. In particular, we show that the anticipated asymptotic formula in Waring's problem for sums of seven cubes holds for all but $O(N^{1/3+ε})$ of the natural numbers not exceeding $N$.
We investigate a version of Waring's Problem over quaternion rings, focusing on cubes in quaternion rings with integer coefficients. We determine the global upper and lower bounds for the number of cubes necessary to represent all such quaternions.
Let $H = N^θ, θ> 2/3$ and $k \geq 1$. We obtain estimates for the following exponential sum over primes in short intervals: \[ \sum_{N < n \leq N+H} Λ(n) e(g(n)), \] where $g$ is a polynomial of degree $k$. As a consequence of this in the special case $g(n) = αn^k$, we deduce a short interval version of the Waring-Goldbach problem.
In this paper we give necessary and sufficient trace conditions for an n by n matrix over any commutative and associative ring with unity to be a sum of k-th powers of matrices over that ring, where n,k are integers greater equal 2. We prove a discriminant criterion for every 2 by 2 matrix over an order R to be sums of cubes and fourth powers over R. We also show that if q is a prime and n greater equal 2, then every n by n matrix over the ring of integers O, of a quadratic number field is a sum of q-th powers (of matrices) over O if and only if q is coprime to the discriminant of the quadrati…
Let $μ_1, \ldots, μ_s$ be real numbers, with $μ_1$ irrational. We investigate sums of shifted cubes $F(x_1,\ldots,x_s) = (x_1 - μ_1)^3 + \ldots + (x_s - μ_s)^3$. We show that if $η$ is real, $τ>0$ is sufficiently large, and $s \ge 9$, then there exist integers $x_1 > μ_1, \ldots, x_s > μ_s$ such that $|F(\mathbf{x})- τ| < η$. This is a real analogue to Waring's problem. We then prove a full density result of the same flavour for $s \ge 5$. For $s \ge 11$, we provide an asymptotic formula. If $s \ge 6$ then $F(\mathbf{Z}^s)$ is dense on the reals. Given nine variables, we can generalise this to…
A cubic (resp. biquadratic) theta series is a power series whose n-th coefficient is equal to 1 if n is a perfect cube (resp. fourth power) and zero otherwise. We improve on a result of Bradshaw by showing that such series is not a cubic (resp. biquadratic) algebraic number when evaluated at reciprocals of integers. The proof relies on a "nested gaps technique" for linear independence and on recent results by the author on Waring's problem for cubes and biquadrates.
We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for cubes, we show, in particular, that the number of positive integers not exceeding N, that fail to have a representation as the sum of six cubes of natural numbers, is O(N^{3/7}).
On generalizations of $p$-sets and their applications
Tianjin Polytechnic University（天津工业大学）；Institute of Computational Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学研究所）
