Related papers: On the structure of the $h$-fold sumsets

A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B_2[g]-set is a set A of integers such that no integer has…

We prove that every partially ordered set on $n$ elements contains $k$ subsets $A_{1},A_{2},\dots,A_{k}$ such that either each of these subsets has size $\Omega(n/k^{5})$ and, for every $i<j$, every element in $A_{i}$ is less than or equal…

Experimental calculations suggest that the $h$-fold sumset sizes of 4-element sets of integers are concentrated at $h$ numbers that are differences of tetrahedral numbers. In this paper it is proved that these "popular" sumset sizes always…

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

For integer $h\geq2$ and $A\subseteq\mathbb{N}$, we define $hA$ to be all integers which can be written as a sum of $h$ elements of $A$. The set $A$ is called an asymptotic basis of order $h$ if $n\in hA$ for all sufficiently large integers…

We compare the size of the difference set $A-A$ to that of the set $kA$ of $k$-fold sums. We show the existence of sets such that $|kA| < |A-A|^{a_k}$ with $a_k<1$.

For $h \geq 1$, a $B_h$-set is a set of integers such that every integer $n$ has at most one representation in the form $n = a_{i_1} + \cdots + a_{i_h}$, where $a_{i_j} \in A$ for all $j = 1,\ldots, h$ and $a_{i_1} \leq \ldots \leq…

In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

Sharpening (a particular case of) a result of Szemeredi and Vu and extending earlier results of Sarkozy and ourselves, we find, subject to some technical restrictions, a sharp threshold for the number of integer sets needed for their sumset…

Let $A=\{a_{1},\ldots,a_{k}\}$ be a nonempty finite subset of an additive abelian group $G$. For a positive integer $h$, the restricted $h$-fold signed sumset of $A$, denoted by $h^{\wedge}_{\pm}A$, is defined as $$h^{\wedge}_{\pm}A =…

Let $h,k \ge 2$ be integers. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

Let $A$ be a subset of an additive abelian semigroup $S$ and let $hA$ be the $h$-fold sumset of $A$. The following question is considered: Let $(A_q)_{q=1}^{\infty}$ be a strictly decreasing sequence of sets in $S$ and let $A =…

Motivated by questions asked by Erdos, we prove that any set $A\subset{\mathbb N}$ with positive upper density contains, for any $k\in{\mathbb N}$, a sumset $B_1+\cdots+B_k$, where $B_1,\dots,B_k\subset{\mathbb N}$ are infinite. Our proof…

Let $h \geq 2$ and let ${ \mathcal A} = (A_1,\ldots, A_h)$ be an $h$-tuple of sets of integers. For nonzero integers $c_1,\ldots, c_h$, consider the linear form $\varphi = c_1 x_1 + c_2x_2 + \cdots + c_h x_h$. The \emph{representation…

A set $A$ of nonnegative integers is called a $B_h$-set if every solution to $a_1+\dots+a_h = b_1+\dots+b_h$, where $a_i,b_i \in A$, has $\{a_1,\dots,a_h\}=\{b_1,\dots,b_h\}$ (as multisets). Let $\gamma_k(h)$ be the $k$-th positive element…