The one-branch conjecture for real Collatz graphs
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.