考拉兹型序列的通用动力学与生成映射
General Dynamics and Generation Mapping for Collatz-type Sequences
AI总结：
该研究提出考拉兹型序列的调控子概念与祖先/后继映射方法，分析3Z+1和5Z+1序列的循环特性，证明3Z+1无辅助循环且推测无发散整数，明确循环奇数的调控子形式。
摘要：
设奇数$\u2715$可表示为$\u276f\u2211_{M>m}b_M2^M\u2770+2^m-1$，其中$b_M\in\{0,1\}$，$2^m-1$被称为“调控子（Governor）”。在考拉兹型函数中，高索引调控子最终会被约简为$2^1-1$。对于$3\mathcal{Z}+1$序列，平凡循环中出现的调控子为$2^1-1$；而对于$5\mathcal{Z}+1$序列，平凡调控子为$2^2-1$和$2^1-1$。因此，在这些特定序列中，考拉兹函数将调控子$2^m-1$约简为平凡调控子$2^\mathcal{T}-1$。\n一旦达到该平凡调控子，它可通过与其他项的相互作用演化成更高索引的调控子。这一特性使得$\u2715$能在考拉兹型序列中重复出现，因为$2^m-1=2^{m-1}+\cdots+2^{\mathcal{T}+1}+2^\mathcal{T}+(2^\mathcal{T}-1)$。因此，若$\u2715$重复出现，则$\u276f\u2211_{M>m}b_M2^M\u2770+2^{m-1}+\cdots+2^{\mathcal{T}+1}+2^\mathcal{T}+(2^\mathcal{T}-1)$的至少一个奇数祖先必须具有调控子$2^m-1$。祖先映射表明，$\u2715$的所有奇数祖先都具有对应考拉兹序列的平凡调控子。这意味着在$3\mathcal{Z}+1$序列中重复出现的奇数具有调控子$2^1-1$，而在$5\mathcal{Z}+1$序列中形成循环的奇数的调控子为$2^2-1$或$2^1-1$。\n针对$3\mathcal{Z}+1$序列的后继映射进一步表明不存在辅助循环，因为平凡调控子总会被转化为不同索引的调控子。类似地，$5\mathcal{Z}+1$序列的后继映射显示，形成辅助循环的最小奇数小于$2^5$。最后，对$3\mathcal{Z}+1$序列中发散整数的探寻表明不存在此类整数。
英文摘要：
Let an odd integer \(\mathcal{X}\) be expressed as $\left\{\sum\limits_{M > m}b_M2^M\right\}+2^m-1,$ where $b_M\in\{0,1\}$ and $2^m-1$ is referred to as the Governor. In Collatz-type functions, a high index Governor is eventually reduced to $2^1-1$. For the $3\mathcal{Z}+1$ sequence, the Governor occurring in the Trivial cycle is $2^1-1$, while for the $5\mathcal{Z}+1$ sequence, the Trivial Governors are $2^2-1$ and $2^1-1$. Therefore, in these specific sequences, the Collatz function reduces the Governor $2^m - 1$ to the Trivial Governor $2^{\mathcal{T}} - 1$. Once this Trivial Governor is reached, it can evolve to a higher index Governor through interactions with other terms. This feature allows $\mathcal{X}$ to reappear in a Collatz-type sequence, since $2^m - 1 = 2^{m - 1} + \cdots + 2^{\mathcal{T} + 1} + 2^{\mathcal{T}}+(2^{\mathcal{T}}-1).$ Thus, if $\mathcal{X}$ reappears, at least one odd ancestor of $\left\{\sum\limits_{M > m}b_M2^M\right\}+2^{m-1}+\cdots+2^{\mathcal{T}+1}+2^{\mathcal{T}}+(2^{\mathcal{T}}-1)$ must have the Governor $2^m-1$. Ancestor mapping shows that all odd ancestors of $\mathcal{X}$ have the Trivial Governor for the respective Collatz sequence. This implies that odd integers that repeat in the $3\mathcal{Z} + 1$ sequence have the Governor $2^1 - 1$, while those forming a repeating cycle in the $5\mathcal{Z} + 1$ sequence have either $2^2 - 1$ or $2^1 - 1$ as the Governor. Successor mapping for the $3\mathcal{Z} + 1$ sequence further indicates that there are no auxiliary cycles, as the Trivial Governor is always transformed into a different index Governor. Similarly, successor mapping for the $5\mathcal{Z} + 1$ sequence reveals that the smallest odd integers forming an auxiliary cycle are smaller than $2^5$. Finally, attempts to identify integers that diverge for the $3\mathcal{Z} + 1$ sequence suggest that no such integers exist.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
