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

算法复杂性:算法和计算结果

Integer complexity: algorithms and computational results

Harry Altman

摘要:

将$\|n\|$定义为$n$的复杂度,即使用加法和乘法的任意组合写入$n$所需的最小1个数。如果对于所有$k\ge 0$,我们有$\|3^k n\|=\|n\|+3k$,则将$n$定义为稳定。在[7]中,作者和Zelinsky证明了对任何$n$,存在一些$K=K(n)$使得$3^K n$是稳定的;然而,那里的证明没有提供关于$K(n)$的上界或任何计算它的方法。本文描述了计算$K(n)$的算法,从而也证明了稳定数的集合是可计算的集合。该算法基于考虑由$δ(n):=\|n\|-3\log_3 n$定义的数的缺陷,建立在[3]中提出的方法的基础上。作为一个附带的好处,该算法也恰好允许快速评估的权力的$2$的复杂性,我们用它来验证,$\|2^k 3^\ell\|=2k+3\ell$的$k\le48$和任意$\ell$(不包括$k=\ell=0$的情况下),提供更多的证据的猜想,即$\|2^k 3^\ell\|=2k+3\ell$时,$k$和$\ell$都不为零。这些算法在Haskell中的实现是可用的。

英文摘要:

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. Define $n$ to be stable if for all $k\ge 0$, we have $\|3^k n\|=\|n\|+3k$. In [7], this author and Zelinsky showed that for any $n$, there exists some $K=K(n)$ such that $3^K n$ is stable; however, the proof there provided no upper bound on $K(n)$ or any way of computing it. In this paper, we describe an algorithm for computing $K(n)$, and thereby also show that the set of stable numbers is a computable set. The algorithm is based on considering the defect of a number, defined by $δ(n):=\|n\|-3\log_3 n$, building on the methods presented in [3]. As a side benefit, this algorithm also happens to allow fast evaluation of the complexities of powers of $2$; we use it to verify that $\|2^k 3^\ell\|=2k+3\ell$ for $k\le48$ and arbitrary $\ell$ (excluding the case $k=\ell=0$), providing more evidence for the conjecture that $\|2^k 3^\ell\|=2k+3\ell$ whenever $k$ and $\ell$ are not both zero. An implementation of these algorithms in Haskell is available.

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

↑