Nested Recurrence Relations with Conolly-like Solutions

DOI10.1137/100795425zbMath1260.11010arXiv1509.02613OpenAlexW2131975287MaRDI QIDQ2902898

Frank Ruskey, Abraham Isgur, Alejandro Erickson, Stephen M. Tanny, Bradley W. Jackson

Publication date: 22 August 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.02613

zbMATH Keywords

bijective proofinfinite treesnested recursionmeta-Fibonacciceiling function identityConolly-likeruler functionself-referencing recursionslowly growing sequence

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Recurrences (11B37)

Related Items (9)

Nested recursions with ceiling function solutions ⋮ Nested recursions, simultaneous parameters and tree superpositions ⋮ Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation ⋮ Solving non-homogeneous nested recursions using trees ⋮ Sums of ceiling functions solve nested recursions ⋮ On a conjecture about generalized \(Q\)-recurrence ⋮ A New Approach to the Hofstadter $Q$-Recurrence ⋮ Constructing New Families of Nested Recursions with Slow Solutions ⋮ Connecting slow solutions to nested recurrences with linear recurrent sequences

This page was built for publication: Nested Recurrence Relations with Conolly-like Solutions