Related papers: Roth's theorem in the primes

In the present work the existence of some patterns of primes is shown which generalize the celebrated result of Green and Tao according to which there are arbitrarily long arithmetic progressions in the sequence of primes

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

TO BE PUBLISHED BY ISRAEL JOURNAL OF MATHEMATICS. We study the mean $\sum_{x\in\mathcal{X}} \bigl|\sum_{p\le N}{}u_p e(xp)\bigr|^{\ell}$ when $\ell$ covers the full range $[2,\infty)$ and $\mathcal{X}\subset\mathbb{R}/\mathbb{Z}$ is a…

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…

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

In this paper, we establish some theorems on the distribution of primes in higher-order progressions on average.

Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math.…

For a polynomial $P$ of degree greater than one, we show the existence of patterns of the form $(x,x+t,x+P(t))$ with a gap estimate on $t$ in positive density subsets of the reals. This is an extension of an earlier result of Bourgain. Our…

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

Let a be a real number between 0 and 1. Ernie Croot showed that the quantity \max_A #(3-term arithmetic progressions in A)/p^2, where A ranges over all subsets of Z/pZ of size at most a*p, tends to a limit as p tends to infinity through…

Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log…

We show that there exists $c>0$ such that any subset of $\{1, \dots, N\}$ of density at least $(\log\log{N})^{-c}$ contains a nontrivial progression of the form $x,x+y,x+y^2$. This is the first quantitatively effective version of the…

We give an elementary, Fourier-free proof of Roth's theorem. The proof follows Roth's original density-increment strategy, but replaces the usual Fourier-analytic step with a direct combinatorial argument involving averages over…

Let $d_n = p_{n+1} - p_n$, where $p_n$ denotes the $n$th smallest prime, and let $R(T) = \log T \log_2 T\log_4 T/(\log_3 T)^2$ (the "Erd{\H o}s--Rankin" function). We consider the sequence $(d_n/R(p_n))$ of normalized prime gaps, and show…

We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.

We add one condition to the theorem of Proth to extend its applicability to $N=k2^n+1$ where $2^n>N^{1/3}$ as opposed to the former constraint of $2^n>k$. This additional condition adds barely any complexity or time to the test and can…

Let $L_1$, $L_2$ $L_3$ be integer linear functions with no fixed prime divisor. We show there are infinitely many $n$ for which the product $L_1(n)L_2(n)L_3(n)$ has at most 7 prime factors, improving a result of Porter. We do this by means…

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…