Sums of ceiling functions solve nested recursions
From MaRDI portal
Abstract: It is known that, for given integers s geq 0 and j > 0, the nested recursion R(n) = R(n - s - R(n - j)) + R(n - 2j - s - R(n - 3j)) has a closed form solution for which a combinatorial interpretation exists in terms of an infinite, labeled tree. For s = 0, we show that this solution sequence has a closed form as the sum of ceiling functions C(n). Further, given appropriate initial conditions, we derive necessary and sufficient conditions on the parameters s1, a1, s2 and a2 so that C(n) solves the nested recursion R(n) = R(n - s1 - R(n - a1)) + R(n- s2 - R(n - a2)).
Recommendations
- Nested recursions with ceiling function solutions
- Nested recursions, simultaneous parameters and tree superpositions
- A combinatorial approach for solving certain nested recursions with non-slow solutions
- Solving non-homogeneous nested recursions using trees
- ‘Golomb-like’ nested recursions with Beatty function solutions
Cited in
(5)- Solving non-homogeneous nested recursions using trees
- Nested recursions with ceiling function solutions
- Nested recurrence relations with Conolly-like solutions
- Nested recursions, simultaneous parameters and tree superpositions
- A combinatorial approach for solving certain nested recursions with non-slow solutions
This page was built for publication: Sums of ceiling functions solve nested recursions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899090)
