Inverse problems for minimal complements and maximal supplements (Q2660321)

Let \(G\) be an (additive) abelian group. Given two subsets \(A\) and \(B\) of \(G\), their \textit{Minkowski sum} is defined as \[ A + B = \{a + b: a \in A, b \in B\}. \] Given a subset \(W\) of \(G\), if there exists a subset \(C\) of \(G\) such that \(W + C = G\), then we say that \(C\) is an \textit{(additive) complement} for \(W\) in \(G\). Moreover, if no proper subset \(C' \subset C\) is a complement for \(W\), then \(C\) is called \textit{minimal (additive) complement} for \(W\) in \(G\). Similarly, if the translations of \(W\) by elements of \(C\) are pairwise disjoint, then we say that \(C\) is an \textit{(additive) supplement} for \(W\) in \(G\). Moreover, if proper superset \(C' \supset C\) is a supplement for \(W\), then \(C\) is called a \textit{maximal (additive) supplement} for \(W\) in \(G\). The minimal complements and maximal supplements have been studied by several researchers. The minimal complements and maximal supplements have connections with problems in coding theory. In the paper under review, the authors investigate the problem of determining the sets \(C\) which arise as minimal complements and maximal supplements for some subset \(W\) of \(G\). They show that in a finite abelian group \(G\), every nonempty subset \(C\) of size \[ |C| \leq \frac{2^{\frac{2}{3}}|G|^{\frac{1}{3}}}{(3e \log{|G|})^{\frac{2}{3}}} \] is a minimal complement for some \(W\). As a corollary of this result, they prove that every finite nonempty subset of an infinite abelian group is a minimal complement. The authors also derive several analogous results for dual problems about maximal supplements.