Kimberling’s golden-ratio array conjectures
Let and, for each integer , define the row . Kimberling's conjectures are: (1) for every , ; (2) if the entries of are arranged in increasing order and each entry is replaced by its rank in this union, then the entries originating in form the lower Wythoff sequence , while those originating in form the upper Wythoff sequence ; and (3), defining for each positive integer , every positive integer occurs infinitely often among the values of , that is, infinitely many such that .
References
Primary source
Additional references
- On three conjectures of Kimberling concerning the array ⌊kφⁿ⌋ — arXiv — Alex Ashburn
Progress summary
An unrefereed preprint claims to settle Kimberling’s three conjectures, while leaving one computational pattern unproved.
Kimberling’s conjectures concern the classical array formed from powers of the golden ratio. The October 2026 preprint by Alex Ashburn claims results on all three conjectures, including exact information about intersections between rows.
October 2026 preprint claim
Ashburn uses Lucas-number structure and the Skolem–Bang theorem to claim proofs of the first two conjectures, a characterization of row intersections, and infinite occurrence of every positive multiplicity. The preprint presents the three conjectures as resolved, but explicitly leaves a reported computational pattern conjectural.
Current status (as of October 2026): An unrefereed preprint claims to resolve all three conjectures, but the claim is not independently verified and one computational pattern remains conjectural.
Sources
Solutions 0
No solutions have been posted yet.