Related papers: Inverse problems for minimal complements and maxim…

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Inspired by recent questions of Nathanson, we show that for any infinite abelian group $G$ and any integers $m_1, \ldots, m_H$, there exist finite subsets $A,B \subseteq G$ such that $|hA|-|hB|=m_h$ for each $1 \leq h \leq H$. We also…

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

Deltoids provide a natural framework for studying defective (partial) matchings in abelian groups, and we develop both structure and existence results in this setting. Given finite subsets $A$ and $B$ of an abelian group $G$, a matching is…

For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a…

We know that any finite abelian group $G$ appears as a subgroup of infinitely many multiplicative groups $\mathbb{Z}_n^\times$ (the abelian groups of size $\phi(n)$ that are the multiplicative groups of units in the rings…

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

For a positive integer $h$ and a subset $A$ of a given finite abelian group, we let $hA$, $h \hat{\;} A$, and $h_{\pm}A$ denote the $h$-fold sumset, restricted sumset, and signed sumset of $A$, respectively. Here we review some of what is…

We show that if A is a finite subset of an abelian group with additive energy at least c|A|^3 then there is a subset L of A with |L|=O(c^{-1}\log |A|) such that |A \cap Span(L)| >> c^{1/3}|A|.

A matching from a finite subset $A$ of an abelian group to another subset $B$ is a bijection $f:A\rightarrow B$ with the property that $a+f(a)$ never lies in $A$. A matching is called acyclic if it is uniquely determined by its multiplicity…

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Let $c$ be the family of irreducible representations of a Weyl group $W$ corresponding to a two-sided cell of $W$. We define a subset $A_c$ of $c$ which contains the special representation of $W$ in $c$ and is in canonical bijection with…

A subset $X$ of an Abelian group $G$ is called $semiaf\!fine$ if for every $x,y,z\in X$ the set $\{x+y-z,x-y+z\}$ intersects $X$. We prove that a subset $X$ of an Abelian group $G$ is semiaffine if and only if one of the following…

In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our…

Suppose that $A$ is a finite, nonempty subset of a cyclic group of either infinite or prime order. We show that if the difference set $A-A$ is ``not too large'', then there is a nonzero group element with at least as many as…

A subset $S$ of an abelian group $G$ is called $3$-$\mathrm{AP}$ free if it does not contain a three term arithmetic progression. Moreover, $S$ is called complete $3$-$\mathrm{AP}$ free, if it is maximal w.r.t. set inclusion. One of the…

Let X be compact abelian group and G its dual (a discrete group). If B is an infinite subset of G, let C_B be the set of all x in X such that <phi(x) : phi \in B> converges to 1. If F is a free filter on G, let D_F be the union of all the…

Let S be a finite set of words over an alphabet Sigma. The set S is said to be complete if every word w over the alphabet Sigma is a factor of some element of S*, i.e. w belongs to Fact(S*). Otherwise if S is not complete, we are interested…

Let G be any abelian group and {a_sG_s}_{s=1}^k be a finite system of cosets of subgroups G_1,...,G_k. We show that if {a_sG_s}_{s=1}^k covers all the elements of G at least m times with the coset a_tG_t irredundant then [G:G_t]\le 2^{k-m}…

A subset $X$ of an Abelian group $G$ is called $midconvex$ if for every $x,y\in X$ the set $\frac{x+y}2=\{z\in G:2z=x+y\}$ is a subset of $X$. We prove that a subset $X$ of an Abelian group $G$ is midconvex if and only if for every $g\in G$…