The main purpose of this survey is to introduce an inexperienced reader to additive prime number theory and some related branches of analytic number theory. We state the main problems in the field, sketch their history and the basic machinery used to study them, and try to give a representative sample of the directions of current research.
A new explicit formula is proved for the contribution of the major arcs in the Goldbach and Generalized Twin Prime Problem, in which the level of the major arcs can be chosen very high. This will have many applications in the approximations of the mentioned problems.
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.
This paper discusses the additive prime divisor function $A(n) := \sum\limits_{p^α|| n} α\, p$ which was introduced by Alladi and Erd\H os in 1977. It is shown that $A(n)$ is uniformly distributed (mod $q$) for any fixed integer $q > 1.$
Let $E$ be a rational elliptic curve, and $K$ be an imaginary quadratic field. In this article we give a method to construct Heegner points when $E$ has a prime bigger than $3$ of additive reduction ramifying in the field $K$. The ideas apply to more general contexts, like constructing Darmon points attached to real quadratic fields which is presented in the appendix.
Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $ε>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$ elements from $A$, where $N$ depends on $n$ and $\espilon$.
We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we assume the Riemann Hypothesis.
Let $\mathtt{PRIMES}$ be the set of all primes. We show that a multiplicative function which satisfies \[ f(p+q-2) = f(p) + f(q) - f(2) \text{ for }p,q \in \mathtt{PRIMES} \] is one of the following: \begin{enumerate} \item $f$ is the identity function \item $f$ is the constant function with $f(n)=1$ \item $f(n)=0$ for $n \ge2$ unless $n$ is odd and squareful. \end{enumerate} As a consequence, a multiplicative function which satisfies \[ f(a+b) = f(a) + f(b) \text{ for }a,b \in \mathtt{PRIMES}-1 \] is the identity function.
We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We likewise treat representations of shifted primes p-1 as sums of two almost prime squares. The methods involve a combination of analytic, automorphic and algebraic arguments to handle representations by restricted binary quadratic forms with a high degree of uniformity.
In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding) conjecture. The goal of this paper is to extend and sharpen their result in three directions by using a different approach (based on the theory of $S$-unit equations).
Assume that $A\subseteq \Fp, B\subseteq \Fp^{*}$, $\1/4\leqslant\frac{|B|}{|A|},$ $|A|=p^α, |B|=p^β$. We will prove that for $p\geqslant p_0(β)$ one has $$\sum_{b\in B}E_{+}(A, bA)\leqslant 15 p^{-\frac{\min\{β, 1-α\}}{308}}|A|^3|B|.$$ Here $E_{+}(A, bA)$ is an additive energy between subset $A$ and it's multiplicative shift $bA$. This improves previously known estimates of this type.
In part I of this paper we studied additive decomposability of the set $\F_y$ of th $y$-smooth numbers and the multiplicative decomposability of the shifted set $\g_y=\F_y+\{1\}$. In this paper, focusing on the case of 'large' functions $y$, we continue the study of these problems. Further, we also investigate a problem related to the m-decomposability of $k$-term sumsets, for arbitrary $k$.
We show that if $E/\mathbb{Q}$ is an elliptic curve with a rational $p$-torsion for $p=2$ or $3$, then there is a congruence relation between Ramanujan's tau function and $E$ modulo $p$. We make use of such congruences to compute the Iwasawa invariants of $2$-adic and $3$-adic Mazur--Tate elements attached to Ramanujan's tau function. We also investigate numerically the Iwasawa invariants of the Mazur--Tate elements attached to an elliptic curve with additive reduction at a fixed prime number.
Let $E$ be a rational elliptic curve and let $p$ be an odd prime of additive reduction. Let $K$ be an imaginary quadratic field and fix a positive integer $c$ prime to the conductor of $E$. The main goal of the present article is to define an anticyclotomic $p$-adic $L$-function $Ł$ attached to $E/K$ when $E/\QQ_p$ attains semistable reduction over an abelian extension. We prove that $Ł$ satisfies the expected interpolation properties; namely, we show that if $χ$ is an anticyclotomic character of conductor $cp^n$ then $χ(Ł)$ is equal (up to explicit constants) to $L(E,χ,1)$ or $L'(E,χ,1)$.
Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much more greater than the number of required iterations. In an other hand we propose new formulations of famous conjectures from the additive theory of numbers (the weak twin prime conjecture, the Polignac conjecture, the Goldbach conjecture or the very general Schinzel's hypothesis H). For the moment these are experimental results obtained using pari-gp.
Improving earlier estimates of several authors we show that the number E(X) of Goldbach exceptional even integers (that is, even integers which cannot be written as the sum of two primesw) below X satisfies tho bound E(X) < X^0.72 for sufficiently large X. In the proof crucial role is played by the explicit formula for the contribution of the major arcs proved in Part I of this series (arXiv:1804.05561). In this new version some misprints are corrected and an explanatory sentence is added to the common proof of theorems C and D.
This is an expository article to accompany my two lectures at the CDM conference. I have used this an excuse to make public two sets of notes I had lying around, and also to put together a short reader's guide to some recent joint work with T.Tao. Contents: 1. An exposition, without much detail, of the work of Goldston, Pintz and Yildirim on gaps between primes; 2. A detailed discussion of the work of Mauduit and Rivat establishing that 50 percent of the primes have odd digit sum when written in base 2; 3. A reader's guide to recent work of T.Tao and the author on linear equations in primes. T…
Fix $δ\in(0,1]$, $σ_0\in[0,1)$ and a real-valued function $\varepsilon(x)$ for which $\limsup_{x\to\infty}\varepsilon(x)\le 0$. For every set of primes ${\mathcal P}$ whose counting function $π_{\mathcal P}(x)$ satisfies an estimate of the form $$π_{\mathcal P}(x)=δ\,π(x)+O\bigl(x^{σ_0+\varepsilon(x)}\bigr),$$ we define a zeta function $ζ_{\mathcal P}(s)$ that is closely related to the Riemann zeta function $ζ(s)$. For $σ_0\le\frac12$, we show that the Riemann hypothesis is equivalent to the non-vanishing of $ζ_{\mathcal P}(s)$ in the region $\{σ>\frac12\}$. For every set of primes ${\mathcal …
We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower bound for $E(Ω,g,x)$.
In this paper we extend and improve our results on weighted averages for the number of representations of an integer as a sum of two powers of primes. Let $1\le \ell_1 \le \ell_2$ be two integers, $Λ$ be the von Mangoldt function and % \(r_{\ell_1,\ell_2}(n) = \sum_{m_1^{\ell_1} + m_2^{\ell_2}= n} Λ(m_1) Λ(m_2) \) % be the weighted counting function for the number of representation of an integer as a sum of two prime powers. Let $N \geq 2$ be an integer. We prove that the Cesàro average of weight $k > 1$ of $r_{\ell_1,\ell_2}$ over the interval $[1, N]$ has a development as a sum of terms depe…
We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be written as a ternary sumset. This proves a conjecture by Sárközy. We also clean up and sharpen existing results on sumset decompositions of the prime numbers.
We remove logarithmic factors in error term estimates in asymptotic formulas for the number of solutions of a class of additive congruences modulo a prime number.
We study the solubility of the binary additive equation $[m^c] + [p^c] = n$, where $m$ is an integer, $p$ is a prime number, and $c$ is a fixed real number in the range $1 < c < 3/2$.
Prime number related fractal polygons and curves are derived by combining two different aspects. One is an approximation of the prime counting function build on an additive function. The other are prime number indexed basis entities taken from the discrete or continuous Fourier basis.
Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility conditions on the square-free number.
Let $p\equiv1\pmod3$ be a prime . We study several topics on additive decompositions concerning the set $C_p$ of all non-zero cubes in the finite field of $p$ elements. For example, we show that when $p>184291$ , the set $C_p$ has no decomposition of the form $C_p=A+B+C$ with $|A|,|B|,|C|\ge2$.
We study the concentration of the distribution of an additive function, when the sequence of prime values of $f$ decays fast and has good spacing properties. In particular, we prove a conjecture by Erdos and Katai on the concentration of $f(n)=\sum_{p|n}(\log p)^{-c}$ when $c>1$.
We obtain new results on additive properties of the set $$ I^{-1}= \{x^{-1}: \quad x\in I\} $$ where $I$ is an arbitrary interval in the field of residue classes modulo a large prime $p$. We combine our results with multilinear exponential sum estimates and obtain new results on incomplete multilinear Kloosterman sums.
We consider numbers formed by concatenating some of the base b digits from additive functions f(n) that closely resemble the prime counting function Ω(n). If we concatenate the last \lceil y \frac{\log \log \log n}{\log b} \rceil digits of each f(n) in succession, then the number so created will be normal if and only if 0 < y \le 1/2. This provides insight into the randomness of digit patterns of additive function after the Erdos-Kac theorem becomes ineffective.
We prove that finite sets of real numbers satisfying $|AA| \leq |A|^{1+ε}$ with sufficiently small $ε> 0$ cannot have small additive bases nor can they be written as a set of sums $B+C$ with $|B|, |C| \geq 2$. The result can be seen as a real analog of the conjecture of Sárközy that multiplicative subgroups of finite fields of prime order are additively irreducible.
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. The Kac-Kubilius model suggests that the distribution of values of a given additive function can be modeled by a sum of random variables. We show that the model is accurate (in a large deviation sense) when one is looking at values of the additive function around its mean, but fails, by a constant multiple, for large values of the additive function. We believe that this phenomenon arises, because the model breaks down for the values of the additive fun…
Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a prime power and, for each integer $n\ge 1$, let $\mathbb F_{q^n}$ be the unique $n$-degree extension of $\mathbb F_q$. The $\mathbb F_q$-orders of an element in $\mathbb F_{q^n}$ and an additive character over $\mathbb F_{q^n}$ have been extensively used in the proof of existence results over finite fields (e.g., the Primitive Normal Basis Theorem). In this note we provide an interesting relation between these two objects.
Let p be an odd prime. We consider the cyclotomic extension T := Z_(p)[zeta_{p^2}] of S := Z_(p), with galois group G := (Z/p^2)^*. Since this extension is wildly ramified, the SG-module T is not projective. We calculate its cohomology ring H^*(G, T; S), carrying the cup product induced by the ring structure of T. Proceeding in a somewhat greater generality, our results also apply to certain Lubin-Tate extensions.
Let P(n) denote the largest prime factor of $n \ge 2, P(1) = 1$, and let $$ β(n) = \sum_{p|n}p, \Beta(n) = \sum_{p^α||n}αp, \Beta_1(n) = \sum_{\p^α||n}p^α$$ denote "large" additive functions. A survey of results on the functions $P(n), β(n), \Beta(n)$ and $\Beta_1(n)$ is presented, as well as some new results and open problems.