相关论文: The primes contain arbitrarily long arithmetic pro…

We show that any set containing a positive proportion of the primes contains a 3-term arithmetic progression. An important ingredient is a proof that the primes enjoy the so-called Hardy-Littlewood majorant property. We derive this by…

In this project we show the existence of arbitrary length arithmetic progressions in model sets and Meyer sets in the Euclidean $d$-space. We prove a van der Waerden type theorem for Meyer sets. We show that pure point subsets of Meyer sets…

We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length $k$ in various sets of integers, in particular in arbitrary dense subsets of the integers, and in the primes.

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…

We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many…

We establish a version of the Furstenberg-Katznelson multi-dimensional Szemer\'edi in the primes ${\mathcal P} := \{2,3,5,\ldots\}$, which roughly speaking asserts that any dense subset of ${\mathcal P}^d$ contains constellations of any…

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

The main result of the paper is that assuming that the level $\theta$ of distribution of primes exceeds 1/2, then there exists a positive $d\leq C(\theta)$ such that there are arbitrarily long arithmetic progressions with the property that…

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 establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…

We prove a version of Szemeredi's regularity lemma for subsets of a typical random set in F_p^n. As an application, a result on the distribution of three-term arithmetic progressions in sparse sets is discussed.

We show that the Gaussian primes $P[i] \subseteq \Z[i]$ contain infinitely constellations of any prescribed shape and orientation. More precisely, given any distinct Gaussian integers $v_0,...,v_{k-1}$, we show that there are infinitely…

I show that a trivial modification of a standard proof of the Roth's Theorem on triples in arithmetic progression would lead to the following Theorem: If A is a "large set" that is its elements are monotone increasing integers and the sum…

Green proved an arithmetic analogue of Szemer\'edi's celebrated regularity lemma and used it to verify a conjecture of Bergelson, Host, and Kra which sharpens Roth's theorem on three-term arithmetic progressions in dense sets. It shows that…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

The transference principle of Green and Tao enabled various authors to transfer Szemer\'edi's theorem on long arithmetic progressions in dense sets to various sparse sets of integers, mostly sparse sets of primes. In this paper, we provide…

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some…

The celebrated Green-Tao theorem states that the prime numbers contain arbitrarily long arithmetic progressions. We give an exposition of the proof, incorporating several simplifications that have been discovered since the original paper.