Collatz问题的图论方法
A Graph Theoretical Approach to the Collatz Problem
摘要:
Andrei等人在2000年证明了Collatz函数的图$\boldsymbol{\mathrm{C}}$在初始循环后以根$8$开始是一棵无限二叉树$\boldsymbol{A}(8)$。根据他们的结果,他们给出了Collatz猜想的一个新版本:顶点集$V(\boldsymbol{A}(8))=\mathbb{Z}^+$。本文用消除了初始环的逆Collatz函数$\overrightarrow{C}$作为Collatz图${\boldsymbol{\mathrm{C}}}_{\overrightarrow{C}}$的生成函数。该图可以被认为是源于具有奇数起始值的2的幂的序列的一个森林和基于其中两个Collatz序列相遇的分支值$y=6k+4$的第二森林的联合。证明了图${\boldsymbol{\mathrm{C}}}_{\overrightarrow{C}}(1)$是一个具有顶点集$V({\boldsymbol{A}}_{\overrightarrow{C}}(1))=\mathbb{Z}^+$的无限二叉树$\boldsymbol{A}_{\overrightarrow{C}}$。
英文摘要:
Andrei et al. have shown in 2000 that the graph $\boldsymbol{\mathrm{C}}$ of the Collatz function starting with root $8$ after the initial loop is an infinite binary tree $\boldsymbol{A}(8)$. According to their result they gave a reformulated version of the Collatz conjecture: the vertex set $V(\boldsymbol{A}(8))=\mathbb{Z}^+$. In this paper an inverse Collatz function $\overrightarrow{C}$ with eliminated initial loop is used as generating function of a Collatz graph ${\boldsymbol{\mathrm{C}}}_{\overrightarrow{C}}$. This graph can be considered as the union of one forest that stems from sequences of powers of 2 with odd start values and a second forest that is based on branch values $y=6k+4$ where two Collatz sequences meet. A proof that the graph ${\boldsymbol{\mathrm{C}}}_{\overrightarrow{C}}(1)$ is an infinite binary tree $\boldsymbol{A}_{\overrightarrow{C}}$ with vertex set $V({\boldsymbol{A}}_{\overrightarrow{C}}(1))=\mathbb{Z}^+$ completes the paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。