arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.16622math.NTmath.CO
收藏

用三个平方和表示的二元分拆函数的值

Values of binary partition function represented by a sum of three squares

Bartosz Sobolewski, Maciej Ulas

摘要:

令$m$是正整数,并且$b_{m}(n)$是$n$的分区的数量,其中部分是2的幂,其中每个部分可以采用$m$颜色。我们证明了如果$m=2^{k}-1$,则存在整数$n$的自然密度,使得$b_{m}(n)$不能表示为三个平方和,并且对于$k=1, 2$等于$1/12$,对于$k\geq 3$等于$1/6$.特别地,对于$m=1$,方程$b_{1}(n)=x^2+y^2+z^2$具有整数解当且仅当$n$不具有$2^{2k+2}(8s+2t_{s}+3)+i$的形式,因为$i=0, 1$和$k, s$是非负整数,并且其中$t_{n}$是Prouhet-Thue-Morse序列中的第$n$项。对方程$b_{2^k-1}(n)=x^2+y^2+z^2$的$n$解也得到了类似的特征。

英文摘要:

Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that $b_{m}(n)$ can not be represented as a sum of three squares and it is equal to $1/12$ for $k=1, 2$ and $1/6$ for $k\geq 3$. In particular, for $m=1$ the equation $b_{1}(n)=x^2+y^2+z^2$ has a solution in integers if and only if $n$ is not of the form $2^{2k+2}(8s+2t_{s}+3)+i$ for $i=0, 1$ and $k, s$ are non-negative integers, and where $t_{n}$ is the $n$th term in the Prouhet-Thue-Morse sequence. A similar characterization is obtained for the solutions in $n$ of the equation $b_{2^k-1}(n)=x^2+y^2+z^2$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑