Related papers: Exact additive complements
Two sets $A,B$ of positive integers are called \emph{exact additive complements}, if $A+B$ contains all sufficiently large integers and $A(x)B(x)/x\rightarrow1$. Let $A=\{a_1<a_2<\cdots\}$ be a set of positive integers. Denote $A(x)$ by the…
Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…
We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.
Two sets $A,B$ of nonnegative integers are called \emph{additive complements}, if all sufficiently large integers can be expressed as the sum of two elements from $A$ and $B$. We further call $A,B$ \emph{perfect additive complements} if…
Two infinite sets $A$ and $B$ of nonnegative integers are called additive complements if their sumset contains every nonnegative integer. In 1964, Danzer constructed infinite additive complements $A$ and $B$ with $A(x)B(x) = (1 + o(1))x$ as…
In this paper we prove that if $A$ and $B$ are infinite subsets of positive integers such that every positive integer $n$ can be written as $n=ab$, $a\in A$, $b\in B$, then $\displaystyle \lim_{x\to \infty}\frac{A(x)B(x)}{x}=\infty $. We…
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…
It was asked by E. Szemer\'edi if, for a finite set $A\subset\mathbb{Z}$, one can improve estimates for $\max\{|A+A|,|A\cdot A|\}$, under the constraint that all integers involved have a bounded number of prime factors -- that is, each…
We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ...…
Let $A$ be a subset of primes up to $x$. If we assume $A$ is well-distributed (in the Siegel-Walfisz sense) in any arithmetic progressions to moduli $q\leqslant(\log x)^c$ for any $c>0$, then the sumset $A+A$ has density 1/2 in the natural…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. Erd\H{o}s…
Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to…
We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…
In this article we describe all possible infinite linear configurations that can be found in a shift of any set of positive upper Banach density. This simultaneously generalizes Szemer\'edi's theorem on arithmetic progressions and the…
An extension of Szemer\'edi's Theorem is proved for sets of positive density in approximate lattices in general locally compact and second countable abelian groups. As a consequence, we establish a recent conjecture of Klick, Strungaru and…
A famous theorem of Szemer\'edi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…
A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…
We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…
Let $A = \{a_{1},a_{2},\dots{}\}$ $(a_{1} < a_{2} < \dots{})$ be an infinite sequence of nonnegative integers, and let $R_{A,2}(n)$ denote the number of solutions of $a_{x}+a_{y}=n$ $(a_{x},a_{y}\in A)$. P. Erd\H{o}s, A. S\'ark\"ozy and V.…