复杂性:整数缺陷
Integer complexity: The integer defect
摘要:
将$\|n\|$定义为$n$的复杂度,即使用加法和乘法的任意组合写入$n$所需的最小1个数。John Selfridge证明了所有$n$的$\|n\|\ge 3\log_3 n$,导致作者和Zelinsky将$n$的缺陷$δ(n)$定义为差异$\|n\|-3\log_3 n$。同时,在加法链的研究中,通常考虑$s(n)$,$n$的小步骤的数目,定义为$\ell(n)-\lfloor\log_2 n\rfloor$,整数量。因此,这里我们类似地定义$D(n)$,$n$的整数缺陷,类似于$s(n)$的$δ(n)$的整数版本。请注意,$D(n)$与$\lceil δ(n) \rceil$不同。我们证明了$D(n)$在[3]中考虑的缺陷良序方面具有额外的意义,因为$D(n)$表明当限制到$n$且$\|n\|$位于指定的同余类模$3$中时,量$δ(n)$位于$ω$的哪些幂之间。我们还用$D(n)\le 1$确定了所有数$n$,并利用这一结果推广了Rawsthorne [18]的一个结果.
英文摘要:
Define $\|n\|$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $\|n\|\ge 3\log_3 n$ for all $n$, leading this author and Zelinsky to define the defect of $n$, $δ(n)$, to be the difference $\|n\|-3\log_3 n$. Meanwhile, in the study of addition chains, it is common to consider $s(n)$, the number of small steps of $n$, defined as $\ell(n)-\lfloor\log_2 n\rfloor$, an integer quantity. So here we analogously define $D(n)$, the integer defect of $n$, an integer version of $δ(n)$ analogous to $s(n)$. Note that $D(n)$ is not the same as $\lceil δ(n) \rceil$. We show that $D(n)$ has additional meaning in terms of the defect well-ordering considered in [3], in that $D(n)$ indicates which powers of $ω$ the quantity $δ(n)$ lies between when one restricts to $n$ with $\|n\|$ lying in a specified congruence class modulo $3$. We also determine all numbers $n$ with $D(n)\le 1$, and use this to generalize a result of Rawsthorne [18].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。