For any positive integers $k_1,k_2$ and any set $A\subseteq \mathbb {N}$, let $R_{k_1,k_2}(A,n)$ be the number of solutions of the equation $n=k_1a_1+k_2a_2$ with $a_1,a_2\in A$. Let g be a fixed integer. We prove that if $k_1$ and $k_2$ are two integers with $2\le k_1<k_2$ and $(k_1,k_2)=1$, then there does not exist any set $A\subseteq \mathbb {N}$ such that $R_{k_1,k_2}(A,n)-R_{k_1,k_2}(\mathbb {N}\setminus A,n)=g$ for all sufficiently large integers n, and if $1=k_1<k_2$, then there exists a set A such that $R_{k_1,k_2}(A,n)-R_{k_1,k_2}(\mathbb {N}\setminus A,n)=1$ for all positive integers n.

For a nonempty set A of integers and an integer n, let $r_{A}(n)$ be the number of representations of n in the form $n=a+a'$, where $a\leqslant a'$ and $a, a'\in A$, and $d_{A}(n)$ be the number of representations of n in the form $n=a-a'$, where $a, a'\in A$. The binary support of a positive integer n is defined as the subset S(n) of nonnegative integers consisting of the exponents in the binary expansion of n, i.e., $n=\sum_{i\in S(n)} 2^i$, $S(-n)=-S(n)$ and $S(0)=\emptyset$. For real number x, let $A(-x,x)$ be the number of elements $a\in A$ with $-x\leqslant a\leqslant x$. The famous Erdős-Turán Conjecture states that if A is a set of positive integers such that $r_A(n)\geqslant 1$ for all sufficiently large n, then $\limsup_{n\rightarrow\infty}r_A(n)=\infty$. In 2004, Nešetřil and Serra initially introduced the notation of “bounded” property and confirmed the Erdős-Turán conjecture for a class of bounded bases. They also proved that, there exists a set A of integers satisfying $r_A(n)=1$ for all integers n and $|S(x)\bigcup S(y)|\leqslant 4|S(x+y)|$ for $x,y\in A$. On the other hand, Nathanson proved that there exists a set A of integers such that $r_A(n)=1$ for all integers n and $2\log x/\log 5+c_1\leqslant A(-x,x)\leqslant 2\log x/\log 3+c_2$ for all $x\geqslant 1$, where $c_1,c_2$ are absolute constants. In this paper, following these results, we prove that, there exists a set A of integers such that: $r_A(n)=1$ for all integers n and $d_A(n)=1$ for all positive integers n, $|S(x)\bigcup S(y)|\leqslant 4|S(x+y)|$ for $x,y\in A$ and $A(-x,x) \gt (4/\log 5)\log\log x+c$ for all $x\geqslant 1$, where c is an absolute constant. Furthermore, we also construct a family of arbitrarily spare such sets A.

Let $\mathbb {N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb {N}$ and $n\in \mathbb {N}$ , let $R_S(n)$ denote the number of solutions of the equation $n=s_1+s_2$ , $s_1,s_2\in S$ and $s_1<s_2$ . Let A be the set of all nonnegative integers which contain an even number of digits $1$ in their binary representations and $B=\mathbb {N}\setminus A$ . Put $A_l=A\cap [0,2^l-1]$ and $B_l=B\cap [0,2^l-1]$ . We prove that if $C \cup D=[0, m]\setminus \{r\}$ with $0<r<m$ , $C \cap D=\emptyset $ and $0 \in C$ , then $R_{C}(n)=R_{D}(n)$ for any nonnegative integer n if and only if there exists an integer $l \geq 1$ such that $m=2^{l}$ , $r=2^{l-1}$ , $C=A_{l-1} \cup (2^{l-1}+1+B_{l-1})$ and $D=B_{l-1} \cup (2^{l-1}+1+A_{l-1})$ . Kiss and Sándor [‘Partitions of the set of nonnegative integers with the same representation functions’, Discrete Math. 340 (2017), 1154–1161] proved an analogous result when $C\cup D=[0,m]$ , $0\in C$ and $C\cap D=\{r\}$ .

For a given set $S\subseteq \mathbb {Z}_m$ and $\overline {n}\in \mathbb {Z}_m$ , let $R_S(\overline {n})$ denote the number of solutions of the equation $\overline {n}=\overline {s}+\overline {s'}$ with ordered pairs $(\overline {s},\overline {s'})\in S^2$ . We determine the structure of $A,B\subseteq \mathbb {Z}_m$ with $|(A\cup B)\setminus (A\cap B)|=m-2$ such that $R_{A}(\overline {n})=R_{B}(\overline {n})$ for all $\overline {n}\in \mathbb {Z}_m$ , where m is an even integer.

Let $\mathbb{N}$ be the set of all nonnegative integers. For any set $A\subset \mathbb{N}$, let $R(A,n)$ denote the number of representations of $n$ as $n=a+a^{\prime }$ with $a,a^{\prime }\in A$. There is no partition $\mathbb{N}=A\cup B$ such that $R(A,n)=R(B,n)$ for all sufficiently large integers $n$. We prove that a partition $\mathbb{N}=A\cup B$ satisfies $|R(A,n)-R(B,n)|\leq 1$ for all nonnegative integers $n$ if and only if, for each nonnegative integer $m$, exactly one of $2m+1$ and $2m$ is in $A$.

For a given set $S\subset \mathbb{N}$, $R_{S}(n)$ is the number of solutions of the equation $n=s+s^{\prime },s<s^{\prime },s,s^{\prime }\in S$. Suppose that $m$ and $r$ are integers with $m>r\geq 0$ and that $A$ and $B$ are sets with $A\cup B=\mathbb{N}$ and $A\cap B=\{r+mk:k\in \mathbb{N}\}$. We prove that if $R_{A}(n)=R_{B}(n)$ for all positive integers $n$, then there exists an integer $l\geq 1$ such that $r=2^{2l}-1$ and $m=2^{2l+1}-1$. This solves a problem of Chen and Lev [‘Integer sets with identical representation functions’, Integers16 (2016), A36] under the condition $m>r$.

Let $\mathbb{N}$ be the set of all nonnegative integers. For a given set $S\subset \mathbb{N}$ the representation function $R_{S}(n)$ counts the number of solutions of the equation $n=s+s^{\prime }$ with $s<s^{\prime }$ and $s,s^{\prime }\in S$. We obtain some results on a problem of Chen and Lev [‘Integer sets with identical representation functions’, Integers16 (2016), Article ID A36, 4 pages] about sets $A$ and $B$ such that $A\cup B=\mathbb{N}$, $A\cap B=r+m\mathbb{N}$ and whose representation functions coincide.

For any finite abelian group $G$ with $|G|=m$, $A\subseteq G$ and $g\in G$, let $R_{A}(g)$ be the number of solutions of the equation $g=a+b$, $a,b\in A$. Recently, Sándor and Yang [‘A lower bound of Ruzsa’s number related to the Erdős–Turán conjecture’, Preprint, 2016, arXiv:1612.08722v1] proved that, if $m\geq 36$ and $R_{A}(n)\geq 1$ for all $n\in \mathbb{Z}_{m}$, then there exists $n\in \mathbb{Z}_{m}$ such that $R_{A}(n)\geq 6$. In this paper, for any finite abelian group $G$ with $|G|=m$ and $A\subseteq G$, we prove that (a) if the number of $g\in G$ with $R_{A}(g)=0$ does not exceed $\frac{7}{32}m-\frac{1}{2}\sqrt{10m}-1$, then there exists $g\in G$ such that $R_{A}(g)\geq 6$; (b) if $1\leq R_{A}(g)\leq 6$ for all $g\in G$, then the number of $g\in G$ with $R_{A}(g)=6$ is more than $\frac{7}{32}m-\frac{1}{2}\sqrt{10m}-1$.

Let $G$ be a finite abelian group and $A\subseteq G$. For $n\in G$, denote by $r_{A}(n)$ the number of ordered pairs $(a_{1},a_{2})\in A^{2}$ such that $a_{1}+a_{2}=n$. Among other things, we prove that for any odd number $t\geq 3$, it is not possible to partition $G$ into $t$ disjoint sets $A_{1},A_{2},\dots ,A_{t}$ with $r_{A_{1}}=r_{A_{2}}=\cdots =r_{A_{t}}$.

For $n\in \mathbb{Z} $ and $A\subseteq \mathbb{Z} $, let ${r}_{A} (n)= \# \{ ({a}_{1} , {a}_{2} )\in {A}^{2} : n= {a}_{1} + {a}_{2} , {a}_{1} \leq {a}_{2} \} $ and ${\delta }_{A} (n)= \# \{ ({a}_{1} , {a}_{2} )\in {A}^{2} : n= {a}_{1} - {a}_{2} \} $. We call $A$ a unique representation bi-basis if ${r}_{A} (n)= 1$ for all $n\in \mathbb{Z} $ and ${\delta }_{A} (n)= 1$ for all $n\in \mathbb{Z} \setminus \{ 0\} $. In this paper, we construct a unique representation bi-basis of $ \mathbb{Z} $ whose growth is logarithmic.