Related papers: Popular progression differences in vector spaces

Szemeredi's regularity lemma is one instance in a family of regularity lemmas, replacing the definition of density of a graph by a more general coefficient. Recently, Fan Chung proved another instance, a regularity lemma for clustering…

Let $p$ be a fixed prime. A triangle in $\mathbb{F}_p^n$ is an ordered triple $(x,y,z)$ of points satisfying $x+y+z=0$. Let $N=p^n=|\mathbb{F}_p^n|$. Green proved an arithmetic triangle removal lemma which says that for every $\epsilon>0$…

Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…

Szemer\'edi's Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain…

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

We prove new cases of reasonable bounds for the polynomial Szemer\'{e}di theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemer\'edi's theorem in the integers…

Let $f_{s,k}(n)$ be the maximum possible number of $s$-term arithmetic progressions in a sequence $a_1<a_2<\ldots<a_n$ of $n$ integers which contains no $k$-term arithmetic progression. For all integers $k > s \geq 3$, we prove that…

We investigate gaps of $n$-term arithmetic progressions $x, x+y, \ldots, x+(n-1)y$ inside a positive measure subset $A$ of the unit cube $[0,1]^d$. If lengths of their gaps $y$ are evaluated in the $\ell^p$-norm for any $p$ other than $1,…

We extend two well-known results in additive number theory, S\'ark\"ozy's theorem on square differences in dense sets and a theorem of Green on long arithmetic progressions in sumsets, to subsets of random sets of asymptotic density 0. Our…

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…

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…

Let $r_k(n)$ denote the maximum cardinality of a set $A \subset \{1,2, \dots, n \}$ such that $A$ does not contain a $k$-term arithmetic progression. In this paper, we give a method of constructing such a set and prove the lower bound…

Combining Freiman's theorem with Balog-Szemeredi-Gowers theorem one can show that if an additive set has large additive energy, then a large piece of the set is contained in a generalized arithmetic progression of small rank and size. In…

We introduce a new variant of Szemer\'edi's regularity lemma which we call the "sparse regular approximation lemma" (SRAL). The input to this lemma is a graph $G$ of edge density $p$ and parameters $\epsilon, \delta$, where we think of…

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible…

We show, for any positive integer k, that there exists a graph in which any equitable partition of its vertices into k parts has at least ck^2/\log^* k pairs of parts which are not \epsilon-regular, where c,\epsilon>0 are absolute…

Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…