Related papers: Arithmetic progressions in sets with small sumsets

We investigate whether there exists an arithmetic progression or geometric progression consisting only palindromic numbers. In this paper we show that the answer to this question is NO. Given the first and final term we will also give an…

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…

In the present paper we show that if A is a set of n real numbers, and the product set A.A has at most n^(1+c) elements, then the k-fold sumset kA has at least n^(log(k/2)/2 log 2 + 1/2 - f_k(c)) elements, where f_k(c) -> 0 as c -> 0. We…

Let $X_k$ denote the number of $k$-term arithmetic progressions in a random subset of $\mathbb{Z}/N\mathbb{Z}$ or $\{1, \dots, N\}$ where every element is included independently with probability $p$. We determine the asymptotics of $\log…

This paper considers some different measures for how additively structured a convex set can be. The main result gives a construction of a convex set $A$ containing $\Omega(|A|^{3/2})$ three-term arithmetic progressions.

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progressions and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result…

It was proved that whenever N is partitioned into finitely many cells, one cell must contain arbitrary length geo-arithmetic progressions. It was also proved that arithmetic and geometric progressions can be nicely intertwined in one cell…

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…

Let the random variable $X\, :=\, e(\mathcal{H}[B])$ count the number of edges of a hypergraph $\mathcal{H}$ induced by a random $m$-element subset $B$ of its vertex set. Focussing on the case that the degrees of vertices in $\mathcal{H}$…

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…

We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…

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.

In this paper, we consider arithmetic progressions contained in Lucas sequences of first and second kind. We prove that for almost all sequences, there are only finitely many and their number can be effectively bounded. We also show that…

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…

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

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 study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…

We classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

Given a finite set $A\subseteq \mathbb{N}$, define the sum set $$A+A = \{a_i+a_j\mid a_i,a_j\in A\}$$ and the difference set $$A-A = \{a_i-a_j\mid a_i,a_j\in A\}.$$ The set $A$ is said to be sum-dominant if $|A+A|>|A-A|$. We prove the…