Critical Slow Growth in Averaged Meta-Fibonacci Recursions
Marco Mantovanelli

TL;DR
This paper studies a family of averaged meta-Fibonacci recursions, revealing regular large-scale behavior, exact structures at critical parameters, and slow growth dynamics, with implications for stability in recursive systems.
Contribution
It introduces a new class of averaged meta-Fibonacci recursions, proves their global well-definedness at critical parameters, and uncovers their asymptotic and structural properties.
Findings
At critical parameter $oldsymbol{oldsymbol{ ext{α=1}}}$, the recursion is well-defined and exhibits a triangular block structure.
The recursion grows approximately as $oldsymbol{oldsymbol{ ext{sqrt(2n)}}}$ asymptotically.
For supercritical $oldsymbol{oldsymbol{ ext{α>1}}}$, linear growth rate must be $oldsymbol{1-rac{1}{α}}$, supported by numerical experiments.
Abstract
We introduce a family of averaged meta-Fibonacci recursions with initial conditions Unlike classical Hofstadter-type recursions, the averaging mechanism produces highly regular large-scale behavior. For the critical parameter value , we prove global well-definedness for all , establish an exact triangular block structure, and show that the value occurs exactly consecutive times. As a consequence, For the supercritical regime , we derive an asymptotic slope constraint showing that any positive linear growth rate, if it exists, must equal Numerical experiments support the existence of a linear-growth phase and suggest a broader…
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.
