Conjecture on termination of the multidimensional Zeckendorf conversion algorithm
Statement
Let be the length of the vector , and let the algorithm in the proof of Theorem main be the conversion algorithm for -representations. A vector is weakly decreasing if for every . Termination conjecture. If , the algorithm terminates when for all , for all , and . If there exists such that , then there is a -representation for which the algorithm fails to terminate. If , the algorithm terminates if and only if is weakly decreasing. The conjecture proposes a precise characterization of when this conversion algorithm terminates; the preceding example shows nontermination for , while the asserted general cases remain unresolved in the supplied source.
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.