关于单调递增表示函数
On monotone increasing representation functions
摘要:
令$k\ge 2$为整数,令$A$为非负整数的集合。集合$A$的表示函数$R_{A,k}(n)$是作为来自$A$的$k$项之和的非负整数$n$的表示的数目。设$A(n)$表示$A$的计数函数,Bell和Shallit最近给出了Dombi猜想的一个反例,证明了如果$A(n)=o(n^{\frac{k-2}{k}-ε})$对某个$ε>0$,则$R_{\mathbb{N}\setminus A,k}(n)$最终严格递增.本文将这一结果推广到$A(n)=O(n^{\frac{k-2}{k-1}})$。我们还给出了一个例子来说明这个界是最好的。
英文摘要:
Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. The representation function $R_{A,k}(n)$ for the set $A$ is the number of representations of a nonnegative integer $n$ as the sum of $k$ terms from $A$. Let $A(n)$ denote the counting function of $A$.Bell and Shallit recently gave a counterexample for a conjecture of Dombi and proved that if $A(n)=o(n^{\frac{k-2}{k}-ε})$ for some $ε>0$, then $R_{\mathbb{N}\setminus A,k}(n)$ is eventually strictly increasing. In this paper, we improve this result to $A(n)=O(n^{\frac{k-2}{k-1}})$. We also give an example to show that this bound is best possible.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。