The one-branch conjecture for real Collatz graphs
The one-branch conjecture for real Collatz graphs
For each , let be the directed graph constructed from the balanced ternary data associated with . A branch is a directed path in of the type used in the paper’s graph construction. One-branch conjecture. has exactly one branch for a Lebesgue-co-null set of .
The paper proves the analogous assertion for a comeager set of real numbers. The conjecture asks for the corresponding full-measure statement.
Sources & referencesView supporting material
Primary source
Manuel Inselmann, “Almost all orbits of an analogue of the Collatz map on the reals attain bounded values”, arXiv:2401.17241 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.