Nested recursions, simultaneous parameters and tree superpositions

zbMath1331.11008arXiv1301.5055MaRDI QIDQ405147

Mustazee Rahman, Vitaly Kuznetsov, Abraham Isgur, Stephen M. Tanny

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

frequency functionmeta-Fibonacci sequencenested recursionsimultaneous parameterslowly growing (or slow) sequencetree superposition

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Recurrences (11B37) Other combinatorial number theory (11B75)

Related Items (4)

A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion ⋮ On the solution space of the Golomb recursion ⋮ Constructing New Families of Nested Recursions with Slow Solutions ⋮ Connecting slow solutions to nested recurrences with linear recurrent sequences

Cites Work

• Unnamed Item
• On variants of Conway and Conolly's meta-Fibonacci recursions
• Meta-Fibonacci sequences, binary trees and extremal compact codes
• Trees and meta-Fibonacci sequences
• Solving non-homogeneous nested recursions using trees
• Nested recursions with ceiling function solutions
• Nested Recurrence Relations with Conolly-like Solutions
• A Combinatorial Interpretation for Certain Relatives of the Conolly Sequence
• A combinatorial approach for solving certain nested recursions with non-slow solutions

This page was built for publication: Nested recursions, simultaneous parameters and tree superpositions