Related papers: Additive number theory and the Dyson transform

Many natural notions of additive and multiplicative largeness arise from results in Ramsey theory. In this paper, we explain the relationships between these notions for subsets of $\mathbb{N}$ and in more general ring-theoretic structures.…

Kneser's theorem in the integers asserts that denoting by $ \underline{\mathrm{d}}$ the lower asymptotic density, if $\underline{\mathrm{d}}(X_1+\cdots+X_k)<\sum_{i=1}^k\underline{\mathrm{d}}(X_i)$ then the sumset $X_1+\cdots+X_k$ is…

We show that there exists $c>0$ such that any subset of $\{1, \dots, N\}$ of density at least $(\log\log{N})^{-c}$ contains a nontrivial progression of the form $x,x+y,x+y^2$. This is the first quantitatively effective version of the…

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Martin Kneser proved the following addition theorem for every abelian group $G$. If $A,B \subseteq G$ are finite and nonempty, then $|A+B| \ge |A+K| + |B+K| - |K|$ where $K = \{g \in G \mid g+A+B = A+B \}$. Here we give a short proof of…

We give a sharpened form of Siegel Lemma's w. r. t. the maximum norm. This implies a new lower bound on the greatest element of a sum-distinct set of positive integers (Erd\"os-Moser problem). The main tools are Minkowski's theorem on…

We study the (generalized) one-dimensional population model developed by Anguige \& Schmeiser [1], which reflects cell-cell adhesion and volume filling under no-flux boundary condition. In this generalized model, depending on the adhesion…

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…

We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\…

Consider a positive Borel measure on a locally compact group. We define a notion of uniform density for such a measure, which is based on a group invariant introduced by Leptin in 1966. We then restrict to unimodular amenable groups and to…

We show that every set $A$ of natural numbers with positive upper density can be shifted to contain the restricted sumset $\{b_1 + b_2 : b_1, b_2\in B \text{ and } b_1 \neq b_2 \}$ for some infinite set $B \subset A$.

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

We improve upon an Omega result due to Soundararajan with respect to general trigonometric polynomials having positive Fourier coefficients. Instead of Dirichlet's approximation theorem we employ the resonance method and this leads to…

Existence of long arithmetic progression in sumsets and subset sums has been studied extensively in the field of additive combinatorics. These additive combinatorics results play a central role in the recent progress of fundamental problems…

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…

The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elements that sum up to a given target $t$. It is an outstanding open question whether the $O^*(2^{n/2})$-time algorithm for Subset Sum by…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…