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

复杂性与良序

Integer Complexity and Well-Ordering

Harry Altman

摘要:

将$\|n\|$定义为$n$的复杂度,即使用加法和乘法的任意组合写入$n$所需的最小1个数。约翰·塞尔弗里奇证明了$\|n\| \ge 3\log_3 n$适用于所有的$n$。将$n$(表示为$δ(n)$)的缺陷定义为$\|n\| - 3\log_3 n$。在本文中,我们考虑的集合$\mathscr{D} := \{δ(n): n \ge 1 \}$的所有缺陷。我们证明了作为实数的子集,集合$\mathscr{D}$是良序的,其序类型为$ω^ω$。更具体地,对于整数$k\ge 1$,$\mathscr{D}\cap[0,k)$具有订单类型$ω^k$。我们还考虑了其他一些与$\mathscr{D}$相关的集合,并证明了这些集合也是良序的,并且具有序类型$ω^ω$。

英文摘要:

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$. Define the defect of $n$, denoted $δ(n)$, to be $\|n\| - 3\log_3 n$. In this paper, we consider the set $\mathscr{D} := \{δ(n): n \ge 1 \}$ of all defects. We show that as a subset of the real numbers, the set $\mathscr{D}$ is well-ordered, of order type $ω^ω$. More specifically, for $k\ge 1$ an integer, $\mathscr{D}\cap[0,k)$ has order type $ω^k$. We also consider some other sets related to $\mathscr{D}$, and show that these too are well-ordered and have order type $ω^ω$.

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

↑