arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.00775cs.DMmath.CO
收藏

Collatz图中祖先的二元表示

Binary expression of ancestors in the Collatz graph

Tristan Stérin

摘要:

Collatz图是具有自然数节点的有向图,并且其中如果$x$是偶数,则存在从节点$x$到节点$T(x)=T_0(x)=x/2$的边,或者如果$x$是奇数,则存在到节点$T(x)=T_1(x)=\frac{3x+1}{2}$的边。研究二进制Collatz图揭示了基于进位传播的复杂消息传递行为,这些行为似乎捕捉到了Collatz过程的基本动态和复杂性。我们研究的集合$\mathcal{E} \text{Pred}_k(x)$,其中包含的任何祖先$y$,达到$x$与有限的预算的$k$应用程序的$T_1$的二进制表达式。已知集合$\mathcal{E} \text{Pred}_k(x)$是正则的,Shallit和Wilson [EATCS 1992]。在本文中,我们发现,Collatz图的几何形状自然会导致一个正则表达式,$\texttt{reg}_k(x)$,它定义了$\mathcal{E} \text{Pred}_k(x)$的建设。我们的建设,是指数的$k$,提高了双指数的建设Shallit和威尔逊。此外,我们的结果推广Colussi的工作在$x = 1$的情况下[TCS 2011],任何自然数$x$,并提供数学和算法工具,进一步探索的Collatz图的二进制。

英文摘要:

The Collatz graph is a directed graph with natural number nodes and where there is an edge from node $x$ to node $T(x)=T_0(x)=x/2$ if $x$ is even, or to node $T(x)=T_1(x)=\frac{3x+1}{2}$ if $x$ is odd. Studying the Collatz graph in binary reveals complex message passing behaviors based on carry propagation which seem to capture the essential dynamics and complexity of the Collatz process. We study the set $\mathcal{E} \text{Pred}_k(x)$ that contains the binary expression of any ancestor $y$ that reaches $x$ with a limited budget of $k$ applications of $T_1$. The set $\mathcal{E} \text{Pred}_k(x)$ is known to be regular, Shallit and Wilson [EATCS 1992]. In this paper, we find that the geometry of the Collatz graph naturally leads to the construction of a regular expression, $\texttt{reg}_k(x)$, which defines $\mathcal{E} \text{Pred}_k(x)$. Our construction, is exponential in $k$ which improves upon the doubly exponentially construction of Shallit and Wilson. Furthermore, our result generalises Colussi's work on the $x = 1$ case [TCS 2011] to any natural number $x$, and gives mathematical and algorithmic tools for further exploration of the Collatz graph in binary.

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

↑