اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Collatz tree as a Hilbert hotel: a proof of the 3x + 1 conjecture
263
0
0.0
(
0
)
تأليف
Jan Kleinnijenhuis
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The yet unproven Collatz conjecture maintains that repeatedly connecting even numbers n to n/2, and odd n to 3n + 1, connects all natural numbers by a unique root path to the Collatz tree with 1 as its root. The Collatz tree proves to be a Hilbert hotel. Numbers divisible by 2 or 3 depart. An infinite binary tree remains with one upward and one rightward child per number. Rightward numbers, and infinitely many generations of their upward descendants, each with a well-defined root path, depart thereafter. The Collatz tree is a Hilbert hotel because still higher upward descendants keep descending to all unoccupied nodes. The density of already departed numbers comes nevertheless arbitrarily close to 100% of the natural numbers. The latter proves the Collatz conjecture.
قيم البحث
اقرأ أيضاً
The Hilbert-Smith Conjecture states that if G is a locally compact group which acts effectively on a connected manifold as a topological transformation group, then G is a Lie group. A rather straightforward proof of this conjecture is given. The moti
vation is work of Cernavskii (``Finite-to-one mappings of manifolds, Trans. of Math. Sk. 65 (107), 1964.) His work is generalized to the orbit map of an effective action of a p-adic group on compact connected n-manifolds with the aid of some new ideas. There is no attempt to use Smith Theory even though there may be similarities.
We present a formulation of the Collatz conjecture that is potentially more amenable to modeling and analysis by automated termination checking tools.
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 then analyse data on the numbers that are in cycles and the length of tuples that represent circuits. 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.
In 1924 David Hilbert conceived a paradoxical tale involving a hotel with an infinite number of rooms to illustrate some aspects of the mathematical notion of infinity. In continuous-variable quantum mechanics we routinely make use of infinite state
spaces: here we show that such a theoretical apparatus can accommodate an analog of Hilberts hotel paradox. We devise a protocol that, mimicking what happens to the guests of the hotel, maps the amplitudes of an infinite eigenbasis to twice their original quantum number in a coherent and deterministic manner, producing infinitely many unoccupied levels in the process. We demonstrate the feasibility of the protocol by experimentally realising it on the orbital angular momentum of a paraxial field. This new non-Gaussian operation may be exploited for example for enhancing the sensitivity of N00N states, for increasing the capacity of a channel or for multiplexing multiple channels into a single one.
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak proof of the c
onjecture by using induction with respect to the degree of the polynomials.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
