Finiteness of paths in the comma successor graph
Statement
For each base , define the successor graph to have one node for every positive integer and a directed edge from to when is the successor to . A path has infinite length if it contains infinitely many edges. Successor-graph finiteness conjecture. For any base , the successor graph does not contain any path of infinite length. The paper proves this for base and presents the general assertion as plausible but unresolved, with possible need for computer assistance in larger bases.
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.