In this paper, we establish a theorem of Bombieri -- Vinogradov type for exponential sums over Piatetski-Shapiro primes $p= [n^{1/γ}]$ with $\frac{865}{886}<γ< 1$.
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.
Let $$γ^*=\frac{8}{9}+\frac{2}{3}\:\frac{\log(10/9)}{\log 10}\:(\approx 0.919\ldots)\:.$$ Let $γ^*<γ_0\leq 1$, $c_0=1/γ_0$ be fixed. Let also $a_0\in\{0,1,\ldots, 9\}$.\\ We prove on assumption of the Generalized Riemann Hypothesis that each sufficiently large odd integer $N_0$ can be represented in the form $$N_0=p_1+p_2+p_3\:,$$ where the $p_i$ are of the form $p_i=[n_i^{c_0}]$, $n_i\in\mathbb{N}$, for $i=1,2$ and the decimal expansion of $p_3$ does not contain the digit $a_0$.\\ The proof merges methods of J. Maynard from his paper on the infinitude of primes with restricted digits, results…
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we establish a theorem of Bombieri-Vinogradov type for the Piatetski-Shapiro primes $p=[n^{1/γ}]$ with $\frac{85}{86}<γ<1$. Moreover, we use this result to prove that, for $0.9989445<γ<1$, there exist infinitely many Piatetski-Shapiro primes such that $p+2=\mathcal{P}_3$, which improves the previous results of Lu, Wang and Cai, and Peneva.
In this paper we improve the result of Akbary and Hambrook by a factor of log x by obtaining a better version of Vaughan's inequality and using the explicit variant of an inequality connected to the Möbius function, derived by Helfgott in his work on ternary Goldbach conjecture.
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.\]
Let $$γ^*:=\frac{8}{9}+\frac{2}{3}\:\frac{\log(10/9)}{\log 10}\:(\approx 0.919\ldots)\:,\ γ^*<\frac{1}{c_0}\leq 1\:.$$ Let $γ^*<γ_0\leq 1$, $c_0=1/γ_0$ be fixed. Let also $a_0\in\{0,1,\ldots, 9\}$. In [23] we proved on assumption of the Generalized Riemann Hypothesis (GRH), that each sufficiently large odd integer $N_0$ can be represented in the form $$N_0=p_1+p_2+p_3\:,$$ where for $i=2, 3$ the primes $p_i$ are Piatetski-Shapiro primes - primes of the form $p_i=[n_i^{c_0}]$, $n_i\in\mathbb{N}$ - whereas the decimal expansion of $p_1$ does not contain the digit $a_0$. In this paper we replace …
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.
The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or strong, Goldbach conjecture had their origin in an exchange of letters between Euler and Goldbach in 1742. We will follow an approach based on the circle method, the large sieve and exponential sums. Some ideas coming from Hardy, Littlewood and Vinogradov are reinterpreted from a modern perspective. While all work here has to be explicit, the focus is on qualita…
Some mean value theorems in the style of Bombieri-Vinogradov's theorem are discussed. They concern binary and ternary additive problems with primes in arithmetic progressions and short intervals. Nontrivial estimates for some of these mean values are given. As application inter alia, we show that for large odd n\not\equiv 1 (6), Goldbach's ternary problem n=p_1+p_2+p_3 is solvable with primes p_1,p_2 in short intervals p_i \in [X_i,X_i+Y] with X_{i}^{θ_i}=Y, i=1,2, and θ_1,θ_2\geq 0.933 such that (p_1+2)(p_2+2) has at most 9 prime factors.
The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \sum_{p\leq x} e(αp), α= a/q + O(1/q^2), has been a central part of the main approach to the conjecture since (Vinogradov, 1937). Previous work required q or x to be too large to make a proof of the conjecture for all n feasible. The present paper gives new bounds on minor arcs and the tails of major arcs. This is part of the author's proof of the ternary Goldbach conjecture. The new bounds are due to several qualitative improvements. In particular, this paper presen…
The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in the twentieth century. In 2013 -- following a line of research pioneered and developed by Hardy, Littlewood and Vinogradov, among others -- the author proved the conjecture. In this, as in many other additive problems, what is at issue is really the proper usage of the limited information we possess on the distribution of prime numbers. The problem serves a…
We prove that the Thue--Morse sequence $\mathbf t$ along subsequences indexed by $\lfloor n^c\rfloor$ is normal, where $1<c<3/2$. That is, for $c$ in this range and for each $ω\in\{0,1\}^L$, where $L\geq 1$, the set of occurrences of $ω$ as a subword (contiguous finite subsequence) of the sequence $n\mapsto \mathbf t_{\lfloor n^c\rfloor}$ has asymptotic density $2^{-L}$. This is an improvement over a recent result by the second author, which handles the case $1<c<4/3$. In particular, this result shows that for $1<c<3/2$ the sequence $n\mapsto \mathbf t_{\lfloor n^c\rfloor}$ attains both of its…
We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramaré that every even natural number can be expressed as the sum of at most six primes. We follow the circle method of Hardy-Littlewood and Vinogradov, together with Vaughan's identity; our additional techniques, which may be of interest for other Goldbach-type problems, include the use of smoothed exponential sums and optimisation of the Vaughan identity parameters to save or reduce some logarithmic losses, the use of multiple scales following some ideas of Bourgain, …
We consider the large sieve inequality for sparse sequences of moduli and give a general result depending on the additive energy (both symmetric and asymmetric) of the sequence of moduli. For example, in the case of monomials $f(X) = X^k$ this allows us to improve, in some ranges of the parameters, the previous bounds of S. Baier and L. Zhao (2005), K.~Halupczok (2012, 2015, 2018) and M.~Munsch (2020). We also consider moduli defined by polynomials $f(X) \in \mathbb{Z}[X]$, Piatetski-Shapiro sequences and general convex sequences. We then apply our results to obtain a version of the Bombieri--…