Representation functions of bases for binary linear forms (Q2479898)

For the set \(\mathbb Z\) of all integers \((\mathbb N\) is the set of positive integers, \(\mathbb N_0 = N\cup \{0\})\) and \(A\subseteq\mathbb Z\) the counting function \(A(x_1,x_2)\) is given by \[ A(x_1,x_2)= \sum^1_{\substack{ a\in A\\ x_1\leq a\leq x_2}} \quad (x_1,x_2\in\mathbb Z). \] Let \(d(A)=\lim_{x\to\infty} A(-x,x)/(2x + 1)\) denote the asymptotic density of the set \(A\). Let \(F(x_1,\dots,x_m)=u_1x_1+\cdots+u_mx_m\) be an \(m\)-ary linear form with nonzero relatively prime coefficients \(u_1,\dots,u_m\in\mathbb Z\). The representation function associated with the form \(F\) is \[ R_{A_n,\dots,A_m,F}(n)=\text{card}(\{a_1,\dots, a_m)\in A_1\times\cdots\times A_m: F(a_1,\dots,a_m)=n\}). \] If \(A_1=\cdots=A_m = A\) it is written \(R_{A,\dots,A,F}(n)=R_{A,F}(n)\). The set \(A\subseteq\mathbb Z\) is a basis for the set \(S\subseteq\mathbb Z\) with respect to the \(m\)-ary linear form \(F\) if \(R_{A,F}(n)\geq 1\) for all \(n\in S.\) The inverse problem for bases is to construct a set \(A\) whose representation function is a given function \(f\). With the main result of this paper the inverse problem for bases with respect to a binary linear form is solved (Theorem 1): Let \(F(x_1,x_2)=u_1x_1 +u_2x_2\) be a binary linear form with relatively prime coefficients \(u_i\in\mathbb Z\setminus\{0\}\)(\(i=1,2)\), \(u_1 u_2\neq\pm 1\) and \(u_1u_2\neq 2\). Let \(f:\mathbb Z\to\mathbb N_0\cup\{\infty\}\)be any function such that the set \(f^{-1}(0)\) has asymptotic density zero. Then there exists a set \(A\subseteq\mathbb Z\) such that \(R_{A,F}(n)=f(n)\) for all \(n\in \mathbb Z\). An application concerns Sidon sets, where a set \(A\) is callied a Sidon set with respect to the \(m\)-ary linear form \(F\) if \(R_{A,F}(n)\leq 1\) for all \(n\in\mathbb Z\).