相关论文: Arithmetic progressions in sets with small sumsets

Let A be a subset of $\F_p^n$, the $n$-dimensional linear space over the prime field $\F_p$ of size at least $\de N$ $(N=p^n)$, and let $S_v=P^{-1}(v)$ be the level set of a homogeneous polynomial map $P:\F_p^n\to\F_p^R$ of degree $d$, and…

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Let H stand for the set of homeomorphisms on [0,1]. We prove the following dichotomy for Borel subsets A of [0,1]: either there exists a homeomorphism f in H such that the image f(A) contains no 3-term arithmetic progressions; or, for every…

Given two sets $\cA, \cB \subseteq \F_q$ of elements of the finite field $\F_q$ of $q$ elements, we show that the productset $$ \cA\cB = \{ab | a \in \cA, b \in\cB\} $$ contains an arithmetic progression of length $k \ge 3$ provided that…

We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log…

This paper is mainly concerned with sets which do not contain four-term arithmetic progressions, but are still very rich in three term arithmetic progressions, in the sense that all sufficiently large subsets contain at least one such…

Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is…

In this paper we prove: If 0 < d < 1, and p is a sufficiently large prime, then if S is a subset of Z/pZ having the least number of three-term arithmetic progressions among all subsets of Z/pZ having at least dp elements, then S has an…

A fundamental result in structural graph theory states that every graph with large average degree contains a large complete graph as a minor. We prove this result with the extra property that the minor is small with respect to the order of…

Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…

We show that there exists a positive constant C such that the following holds: Given an infinite arithmetic progression A of real numbers and a sufficiently large integer n (depending on A), there needs at least Cn geometric progressions to…

We give conditions under which certain digit-restricted integer sets avoid $k$-term arithmetic progressions. These sets and their harmonic sums can be computed efficiently. Through large-scale search, we identify integer sets avoiding…

Various authors, including McNew, Nathanson and O'Bryant, have recently studied the maximal asymptotic density of a geometric progression free sequence of positive integers. In this paper we prove the existence of geometric progression free…

We analyze sumsets A+B = {a+b : a in A, b in B} where A,B are sets of integers, A is infinite, and B has positive upper Banach density. For each k, we show that A+B contains at least the expected density of k-term arithmetic progressions…

We prove that for any partition of a set which contains an infinite arithmetic (respectively geometric) progression into two disjoint subsets, at least one of these subsets contains an infinite number of triplets such that each triplet is…

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

Using the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We…

Let $h\geq 2$ and $A=\{a_0,a_1,\ldots,a_{k-1}\}$ be a finite set of integers. It is well-known that $\left|hA\right|=hk-h+1$ if and only if $A$ is a $k$-term arithmetic progression. In this paper, we give some nontrivial inverse results of…

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…

Szemer\'edi's theorem implies that there are $2^{o(n)}$ subsets of $[n]$ which do not contain a $k$-term arithmetic progression. A sparse analogue of this statement was obtained by Balogh, Morris, and Samotij, using the hypergraph container…