On the integer sets with the same representation functions

DOI10.1017/S0004972722000119MaRDI QIDQ6383078arXivFDO

Authors Kai-Jie Jiao, Csaba Sándor, Quan-Hui Yang, Jun-Yu Zhou

Publication date 15 November 2021

Published in arXiv

Full work available at URL https://doi.org/10.1017/S0004972722000119

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Representation functions (11B34)

arXiv classification

math.NT

Abstract: Let $mathbbN$ be the set of all nonnegative integers. For $SsubseteqmathbbN$ and $ninmathbbN$, let $R_S(n)$ denote the number of solutions of the equation $n=s_1+s_2$, $s_1,s_{2}inS$ 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=mathbbNsetminusA$. Put $A_l=Acap[0,2^l-1]$ and $B_l=Bcap[0,2^l-1]$. In 2017, Kiss and S'{a}ndor proved that, if $CcupD=[0,m]$, $0inC$ and $CcapD=r$, then $R_C(n)=R_D(n)$ for every positive integer $n$ if and only if there exists an integer $lge1$ such that $r=2^{2l}-1$, $m=2^{2l+1}-2$, $C=A_{2l}cup(2^{2l}-1+B_{2l})$ and $D=B_{2l}cup(2^{2l}-1+A_{2l})$. This solved a problem of Chen and Lev. In this paper, we prove that, if $CcupD=[0,m]setminusr$ with $0<r<m$, $CcapD=emptyset$ and $0inC$, then $R_C(n)=R_D(n)$ for any nonnegative integer $n$ if and only if there exists an integer $lgeq2$ such that $m=2^l$, $r=2^{l-1}$, $C=A_{l-1}cupleft(2^{l-1}+1+B_{l-1}ight)$ and $D=B_{l-1}cupleft(2^{l-1}+1+A_{l-1}ight)$.

This page was built for publication: On the integer sets with the same representation functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6383078)