Related papers: On Primes in Quadratic Progressions

We show how a recent result by Aka and Shapira on the evolution of continued fractions in a fixed quadratic field implies the classic result of de Mathan and Teulli\'e on the Mixed Littlewood

We consider estimates of Hardy and Littlewood for norms of operators on sequence spaces, and we apply a factorization result of Maurey to obtain improved estimates and simplified proofs for the special case of a positive operator.

Let $1\leq a<q$ be a pair of small integers such that $\gcd(a,q)=1$ and let $x>1$ be a large number. This note discusses the existence of a short sequence of primes $p\equiv a\bmod q$ between two squares $x^2$ and $(x+1)^2$.

In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture…

The best known upper estimates for the constants of the Hardy--Littlewood inequality for $m$-linear forms on $\ell_{p}$ spaces are of the form $\left(\sqrt{2}\right) ^{m-1}.$ We present better estimates which depend on $p$ and $m$. An…

We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…

We continue our recent work on additive problems with prime summands: we already studied the \emph{average} number of representations of an integer as a sum of two primes, and also considered individual integers. Furthermore, we dealt with…

We conjecture average counting functions for prime $k$-tuples based on a gamma distribution hypothesis for prime powers. The conjecture is closely related to the Hardy-Littlewood conjecture for $k$-tuples but yields better estimates.…

For any real $x$ and any integer $k\ge1$, we say that a set $\mathcal{D}_{k}$ of $k$ distinct integers is a $k$-tuple jumping champion if it is the most common differences that occurs among $k+1$ consecutive primes less than or equal to…

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…

We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers…

We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.

In a recent short note the first author gave the first positive result on the higher order regularity of the discrete noncentered Hardy-Littlewood maximal function. In this article we conduct a thorough investigation of possible similar…

This is an article for a general mathematical audience on the author's work, joint with Terence Tao, establishing that there are arbitrarily long arithmetic progressions of primes. It is based on several one hour lectures, chiefly given at…

In this paper, we consider pairs of a prime and a prime power with a fixed difference. We prove an average result on the distribution of such pairs. This is a partial improvement of the result of Bauer (1998).

In this paper we provide a family of inequalities, extending a recent result due to Albuquerque et al.

We employ the recent generalization of the Hardy--Stein identity to extend the previous Littlewood--Paley estimates to general pure-jump Dirichlet forms. The results generalize those for symmetric pure-jump L\'evy processes in Euclidean…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…

The paper substantiates the conjecture of the asymptotic behavior of the largest distance between consecutive primes: $sup_{p_i \leq x}(p_{i+1}-p_i) \sim 2e^{-\gamma} \log^2(x)$, where $\gamma$ is the Euler constant. The Hardy-Littlewood…