On a problem of Cilleruelo and Nathanson (Q2428636)

For a set \(A\) of integers, \(d_A(n)\) denotes the number of representations of \(n\) by a difference, and \(s_A(n)\) the number of representations by a sum, order ignored. Given two functions \(f_1: \mathbb N \to \mathbb N\) and \(f_2: \mathbb Z \to \mathbb N\), the existence of a set \(A\) is proved such that \(d_A=f_1\) and \(s_A=f_2\), provided the set \[ \{ n: f_1( | n| )\geq 2, f_2(n) \geq 2 \} \] contains arbitrarily long blocks. This answers a question of \textit{J.~Cilleruelo and M. B.~Nathanson} [Combinatorica 28, 401--414 (2008; Zbl 1199.11045)].