Achievable sets in \(\mathbb Z^n\). (Q487116)

A set \(A\subset\mathbb Z^n\) is called achievable if it can be written in the form \((K-K)\cap\mathbb Z^n\), where \(K\) is a compact subset of \(\mathbb R^n\) such that \(K+\mathbb Z^n=\mathbb R^n\). \textit{M. B. Nathanson} [in Additive number theory. Festschrift in honor of the sixtieth birthday of Melvyn B. Nathanson. New York: Springer. 249-258 (2010; Zbl 1256.11054)] proved that for \(n=1\) a set \(A\subset\mathbb Z\) is achievable if and only if \(\mathbb Z\) is the smallest group containing \(A\). The problem has a natural generalization where \(\mathbb R^n\) is replaced by a metric space \(X\) and \(\mathbb Z^n\) is replaced by a group \(G\) which acts on \(X\). Nathanson showed that even in the more general case if \(A\subset G\) is an achievable set, then \(A\) generates \(G\). However, this condition is not sufficient even in two dimensions. In an attempt to obtain a characterization of achievable sets the author associates a characteristic graph \(\mathcal G(A)\) with any finite, symmetric set \(A\subset\mathbb Z^n\) containing zero. Then if \(A\) is achievable, the set associated to some connected component of \(\mathcal G(A)\) is also achievable. This result is then strengthened in two dimensions. Further generalizations and open questions are discussed.