Collatz图变体中循环的观察
Observations on cycles in a variant of the Collatz Graph
AI总结:
本文研究Collatz图的一个变体,允许3x+1操作应用于奇偶数,证明宽松Collatz函数的性质,揭示元组的唯一分解幺半群结构及高维几何解释,为Collatz猜想无循环提供线索。
摘要:
众所周知,Collatz猜想可以重新解释为以1为根顶点的Collatz图,询问是否所有正整数都包含在生成的树中。进一步已知,Collatz图中的任何循环都可以表示为一个元组,前提是将它们输入某个函数后输出一个正奇数;然而,是否存在任何不形如$(2,2,...,2)$的元组(从而否定Collatz猜想)仍是一个开放问题。在本文中,我们探讨了Collatz图的一个变体,该变体允许将3x+1操作应用于偶数和奇数。我们为这一变体证明了一个类似函数,称为宽松Collatz函数(LCF),并观察了LCF与元组和输出相关的各种性质。我们证明了LCF的元组具有某种底层唯一分解幺半群结构,并提供了满足条件的元组在高维空间中的几何解释。对这一Collatz图变体的研究可能为Collatz图中不存在循环提供原因。
英文摘要:
It is well known that the Collatz Conjecture can be reinterpreted as the Collatz Graph with root vertex 1, asking whether all positive integers are within the tree generated. It is further known that any cycle in the Collatz Graph can be represented as a tuple, given that inputting them into a function outputs an odd positive integer; yet, it is an open question as to whether there exist any tuples not of the form $(2,2,...,2)$, thus disproving the Collatz Conjecture. In this paper, we explore a variant of the Collatz Graph, which allows the 3x+1 operation to be applied to both even and odd integers. We prove an analogous function for this variant, called the Loosened Collatz Function (LCF), and observe various properties of the LCF in relation to tuples and outputs. We prove a certain underlying unique factorisation monoid structure for tuples to the LCF and provide a geometric interpretation of satisfying tuples in higher dimensions. Research into this variant of the Collatz Graph may provide reason as to why there exist no cycles in the Collatz Graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。