A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion
DOI10.1080/10236198.2019.1582648zbMath1418.05023OpenAlexW2917015723WikidataQ128308761 ScholiaQ128308761MaRDI QIDQ5378519
Yvon Verberne, Matthew Sunohara, Stephen M. Tanny
Publication date: 3 June 2019
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10236198.2019.1582648
meta-Fibonacci sequencenon-homogeneous nested recursionnon-monotoniccombinatorial counting argumentgeneralized Golomb recursiontree-based methodology
Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Recurrences (11B37)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nested recursions, simultaneous parameters and tree superpositions
- Meta-Fibonacci sequences, binary trees and extremal compact codes
- Trees and meta-Fibonacci sequences
- Solving non-homogeneous nested recursions using trees
- Constructing New Families of Nested Recursions with Slow Solutions
- On the solution space of the Golomb recursion
- Spot-Based Generations for Meta-Fibonacci Sequences
- A combinatorial approach for solving certain nested recursions with non-slow solutions
- On the Behavior of a Family of Meta-Fibonacci Sequences
This page was built for publication: A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion