Related papers: Sets Arising as Minimal Additive Complements in th…

We show that a set is almost periodic if and only if the associated exponential sum is concentrated in the minor arcs. Hence binary additive problems involving almost periodic sets can be solved using the circle method.

In this paper we prove that a set of points $B$ of PG(n,2) is a minimal blocking set if and only if $<B>=PG(d,2)$ with $d$ odd and $B$ is a set of $d+2$ points of $PG(d,2)$ no $d+1$ of them in the same hyperplane. As a corollary to the…

We study the minimal gap statistic for sequences of the form $\left( \alpha x_n \right)_{n = 1}^{\infty}$ where $\left( x_n \right)_{n = 1}^{\infty}$ is a sequence of real numbers, and its connection to the additive energy of $\left( x_n…

A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of…

By the Galvin-Mycielski-Solovay theorem, a subset $X$ of the line has Borel's strong measure zero if and only if $M+X\neq\mathbb{R}$ for each meager set $M$. A set $X\subseteq\mathbb{R}$ is meager-additive if $M+X$ is meager for each meager…

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…

A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…

In this paper, we describe the relationship between the quasi-component q(G) of a (perfectly) minimal pseudocompact abelian group G and the quasi-component q(\widetilde G) of its completion. Specifically, we characterize the pairs (C,A) of…

A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…

{The first version of this text was written and submitted to a journal on April, 12, 2018. This second version was submitted on April, 9, 2019.} We investigate the existence of subsets $A$ and $B$ of $\mathbb{N}:=\{0,1,2,\dots\}$ such that…

The paper deals with a problem of Additive Combinatorics. Let ${\mathbf G}$ be a finite abelian group of order $N$. We prove that the number of subset triples $A,B,C\subset {\mathbf G}$ such that for any $x\in A$, $y\in B$ and $z\in C$ one…

The famous Erdos-Heilbronn conjecture plays an important role in the development of additive combinatorics. In 2007 Z. W. Sun made the following further conjecture (which is the linear extension of the Erdos-Heilbronn conjecture): For any…

Let $G$ be a discrete abelian group. F{\o}lner showed that if $A \subseteq G$ has positive upper Banach density, then $A - A$ contains an almost Bohr set -- a set of the form $B \setminus E$ where $B$ is a Bohr set and $E$ has zero Banach…

Two infinite sets $A$ and $B$ of non-negative integers are called \emph{perfect additive complements of non-negative integers}, if every non-negative integer can be uniquely expressed as the sum of elements from $A$ and $B$. In this paper,…

We consider two questions of Ruzsa on how the minimum size of an additive basis $B$ of a given set $A$ depends on the domain of $B$. To state these questions, for an abelian group $G$ and $A \subseteq D \subseteq G$ we write $\ell_D(A)…

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…

A set $M\subset\mathbb{R}$ is microscopic if for each $\varepsilon>0$ there is a sequence of intervals $(J_n)_{n\in\omega}$ covering $M$ and such that $|J_n|\leq \varepsilon^{n+1}$ for each $n\in\omega$. We show that there is a microscopic…

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…

In a finite abelian group $G$, define an additive matching to be a collection of triples $(x_i, y_i, z_i)$ such that $x_i + y_j + z_k = 0$ if and only if $i = j = k$. In the case that $G = \mathbb{F}_2^n$, Kleinberg, building on work of…

For a finite abelian group $G$ with subsets $A$ and $B$, the sumset $AB$ is $\{ab \mid a\in A, b \in B\}$. A fundamental problem in additive combinatorics is to find a lower bound for the cardinality of $AB$ in terms of the cardinalities of…