On an additive question (Q4407963)

For any two sets \(A\) and \(B\), denote \(C=A\oplus B\) if \(C=A+B\) and every \(c\in C\) has unique representation \(c=a+b\), where \(a\in A\) and \(b\in B\), and \(A, B\) are called a complementing pair. This article considers the case \(C={\mathbb Z}^k\), where \(k\) is an integer. For any finite set \(A\subseteq C\), the main theorem in this article gives an equivalent condition for the existence of a complementing pair of \(A\) in \(C\). Specifically it shows that a finite set \(F\) and an associated set \(G\subseteq F^{k+1}\) can be determined in proper time so that such a complementing pair exists if and only if there exists a map \(f: {\mathbb Z}^k\to F\) with \[ (f(P),f(P+e(1)),\cdots,f(P+e(k)))\in G, \] for all \(P\in{\mathbb Z}^k\), where \(e(i)\in{\mathbb Z}^k\) and has \(i\)th component 1 all others 0, and ``proper time'' means in time not exceeding a constant depending at most on \(k\) and \(N_1\cdots N_k\) with given positive integers \(N_1,\dots,N_k\). The theorem implies that in the case of \(C={\mathbb Z},\) for any given set \(A\) of finite diameter \(N\), there will be at most \(N\) \(\mathbb Z\)-complementing sets of \(A\). Further there is a bijection between the maps \(f\) and the complementing sets of \(A\). The article also gives an inductive (on \(k\)) result with regard to the determination of sets \(F\) and \(G\) so that the question can be reduced to the case of \(k=1\). However, reduction on \(k\) does not guarantee ``proper time'', hence the determination of the existence of a complementing set for a given set within proper time remains unresolved. Proofs will be given elsewhere. For the entire collection see [Zbl 0997.00018].