Related papers: A quantitative bound on Furstenberg-S\'ark\"ozy pa…
We show that if A is a subset of {1, ..., n} such that it has no pairs of elements whose difference is equal to p-1 with p a prime number, then the size of A is O(n(loglog n)^(-clogloglogloglog n)) for some positive constant c.
Consider averages along the prime integers $ \mathbb P $ given by \begin{equation*} \mathcal{A}_N f (x) = N ^{-1} \sum_{ p \in \mathbb P \;:\; p\leq N} (\log p) f (x-p). \end{equation*} These averages satisfy a uniform scale-free $ \ell…
Let $N$ be a large prime and $P, Q \in \mathbb{Z}[x]$ two linearly independent polynomials with $P(0) = Q(0) = 0$. We show that if a subset $A$ of $\mathbb{Z}/N\mathbb{Z}$ lacks a progression of the form $(x, x + P(y), x + Q(y), x + P(y) +…
In a previous paper of the authors, we showed that for any polynomials $P_1,\dots,P_k \in \Z[\mathbf{m}]$ with $P_1(0)=\dots=P_k(0)$ and any subset $A$ of the primes in $[N] = \{1,\dots,N\}$ of relative density at least $\delta>0$, one can…
Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…
We study the distribution of the values of the form $\lambda_1 p_1 + \lambda_2 p_2 + \lambda_3 p_3^k$, where $\lambda_1$, $\lambda_2$ and $\lambda_3$ are non-zero real number not all of the same sign, with $\lambda_1 / \lambda_2$…
We prove an asymptotic formula for the number of primes of the shape $a^2 +p^4$, thereby refining the well known work of Friedlander and Iwaniec. Along the way, we prove a result on equidistribution of primes up to $x$, in which the moduli…
Suppose that $1<c<9/8$. For any $m\geq 1$, there exist infinitely many $n$ such that $$ \{[n^c],\ [(n+1)^c],\ \ldots,\ [(n+k_0)^c]\} $$ contains at least $m+1$ primes, if $k_0$ is sufficiently large (only depending on $m$).
We establish the following quantitative form of the Green--Tao theorem: if a set $\mathcal{A}$ of relative density $\delta$ within the primes up to $N$ contains no nontrivial arithmetic progressions of length $k\geq 4$, then $\delta\ll…
A collection of families $(\mathcal{F}_{1}, \mathcal{F}_{2} , \cdots , \mathcal{F}_{k}) \in \mathcal{P}([n])^k$ is cross-Sperner if there is no pair $i \not= j$ for which some $F_i \in \mathcal{F}_i$ is comparable to some $F_j \in…
Fix \epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \equiv p_{r+1} \equiv a \mod q and p_{r+1} - p_r < \epsilon\log p_r.…
Let $1<c<\frac{1787}{1502}$ and $N$ be a sufficiently large real number. In this paper, it is proved that for any arbitrarily large number $E>0$ and for almost all real $R \in (N,2N]$, the Diophantine inequality…
We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound.…
We obtain an asymptotic formula for the number of primes $p\leq x_1$, $p\leq x_2$ such that $p_1(p_2+a)\equiv l \pmod q$ with $(a,q)=(l,q)=1$, $q\leq x^{\kappa_0}$, $x_1\geq x^{1-\alpha}$, $x_2\geq x^{\alpha}$, $$…
Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. For $z\geqslant 0$, let $G(n;z)$ denote the number of those indexes $j$ such that $p_{j+1}(n)>p_j(n)^{\exp z}$. We show uniform…
We study arithmetic progressions in primes with common differences as small as possible. Tao and Ziegler showed that, for any $k \geq 3$ and $N$ large, there exist non-trivial $k$-term arithmetic progressions in (any positive density subset…
We prove that if $A$ is a subset of those primes which are congruent to $1 \pmod{3}$ such that the relative density of $A$ in this residue class is larger than $\frac{1}{2},$ then every sufficiently large odd integer $n$ which satisfies $n…
Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…
Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…
In this paper we show that, for any fixed $1<c<\frac{5363}{3900}$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c+p_5^c-N|<\varepsilon…