Logarithmic step bound for the large steps algorithm
Let and let . In the Large Steps Algorithm, let denote the bound on the largest index used in the resulting decomposition. Large steps logarithmic-bound conjecture. There exist constants such that
Consequently, . The paper proves this bound for and conjectures its extension to all based on computational evidence; the corresponding general result remains open.
References
- Ivan Bortnovskyi, June Duvivier, Pedro Espinosa, Michael Lucas, Steven J. Miller, Tiancheng Pan, Arman Rysmakhanov, Iana Vranesko, Ren Watson and Steven Zanetti, “Properties of Multidimensional Vector Zeckendorf Representations”, arXiv:2510.15923 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.