Nested Recurrence Relations With Conolly-Like Solutions
Alejandro Erickson, Abraham Isgur, Bradley W. Jackson, Frank, Ruskey, Stephen M. Tanny

TL;DR
This paper studies Conolly-like sequences arising as solutions to nested recurrence relations, proving finiteness of solutions for fixed parameters and constructing explicit examples with complete understanding of their behavior.
Contribution
It establishes finiteness results for Conolly-like solutions, provides bijective proofs for specific cases, and constructs examples of nested recursions with fully characterized solutions.
Findings
Finiteness of (, )-Conolly pairs for fixed recursion parameters
Existence of solutions for all (,) pairs when k=2 and p_i are equal
Characterization of when a nested recurrence is (,0)-Conolly via ceiling function identities
Abstract
A nondecreasing sequence of positive integers is -Conolly, or Conolly-like for short, if for every positive integer the number of times that occurs in the sequence is , where is plus the 2-adic valuation of . A recurrence relation is -Conolly if it has an -Conolly solution sequence. We discover that Conolly-like sequences often appear as solutions to nested (or meta-Fibonacci) recurrence relations of the form with appropriate initial conditions. For any fixed integers and we prove that there are only finitely many pairs for which can be -Conolly. For the case where and , we provide a bijective proof using labelled infinite trees to show that, in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
