ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each base b≥3b\geq 3, define the successor graph GsG_s to have one node for every positive integer and a directed edge from ii to jj when jj is the successor to ii. A path has infinite length if it contains infinitely many edges. Successor-graph finiteness conjecture. For any base b≥3b\geq 3, the successor graph GsG_s does not contain any path of infinite length. The paper proves this for base 33 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.