相关论文: The Gaussian primes contain arbitrarily shaped con…

The Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomial configuration x+P_1(m), ..., x+P_k(m), where x,m are…

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…

A geometric-arithmetic progression of primes is a set of $k$ primes (denoted by GAP-$k$) of the form $p_1 r^j + j d$ for fixed $p_1$, $r$ and $d$ and consecutive $j$, {\it i.e}, $\{p_1, \, p_1 r + d, \, p_1 r^2 + 2 d, \, p_1 r^3 + 3 d,…

Green and Tao famously proved in a 2008 paper that there are arithmetic progressions of prime numbers of arbitrary lengths. Soon after, analogous statements were proved by Tao for the ring of Gaussian integers and by L\^e for the polynomial…

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 $0.989<\gamma<1$, there exist infinitely many primes $p$ such that…

Let $S$ be a string of $l$ decimal digits. We give an explicit upper bound on some prime $p$ whose decimal representation contains the string $S$. We also show, as a corollary of the Green-Tao theorem, that there are arbitrarily long…

We prove that the primes of the form $x^2+y^2+1$ contain arbitrarily long non-trivial arithmetic progressions.

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…

We study the properties of certain graphs involving the sums of primes. Their structure largely turns out to relate to the distribution of prime gaps and can be roughly seen in Cram\'er's model as well. We also discuss generalizations to…

The Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded. In this paper, we have proved that the…

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

We use Vaughan's variation on Vinogradov's three-primes theorem to prove Zariski-density of prime points in several infinite families of hypersurfaces, including level sets of some quadratic forms, the Permanent polynomial, and the defining…

In a recent joint work with D.A. Goldston and C.Y. Yildirim we just missed by a hairbreadth a proof that bounded gaps between primes occur infinitely often. In the present work it is shown that adding to the primes a much thinner set,…

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

Let $p_n$ denote the $n$th prime and $g_n:=p_{n+1}-p_n$ the $n$th prime gap. We demonstrate the existence of infinitely many values of $n$ for which $g_n>g_{n+1}>\cdots>g_{n+m}$ with $m\gg \log\log\log n$ and similarly for the reversed…

Let $\PP^d$ be the $d$-fold direct product of the set of primes. We prove that if $A$ is a subset of $\PP^d$ of positive relative upper density then $A$ contains infinitely many "corners", that is sets of the form $\{x,x+te_1,...,x+te_d\}$…

Recently Conlon, Fox, and the author gave a new proof of a relative Szemer\'edi theorem, which was the main novel ingredient in the proof of the celebrated Green-Tao theorem that the primes contain arbitrarily long arithmetic progressions.…