The one-branch conjecture for real Collatz graphs

For each x(0,)x\in(0,\infty), let GxG_x be the directed graph constructed from the balanced ternary data associated with xx. A branch is a directed path in GxG_x of the type used in the paper’s graph construction. One-branch conjecture. GxG_x has exactly one branch for a Lebesgue-co-null set of x(0,)x\in(0,\infty).

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.