The interval decomposition conjecture for Ulam sequences U(1,n)
The interval decomposition conjecture for Ulam sequences U(1,n)
Let denote the generalized Ulam sequence starting with integers , where each subsequent term is the smallest integer representable as the sum of two distinct preceding terms in exactly one way. For , consider the sequence .
Interval decomposition conjecture. There exist integer coefficients such that, for every integer ,
The conjecture asserts a simple, uniform interval structure for all with , extending the explicitly observed initial patterns; it was confirmed computationally for thousands of terms but is not established in the supplied text.
Sources & referencesView supporting material
Primary source
Joshua Hinman, Borys Kuca, Alexander Schlesinger and Arseniy Sheydvasser, “The Unreasonable Rigidity of Ulam Sets”, arXiv:1711.00145 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.