Sums of Ceiling Functions Solve Nested Recursions

Details Sums of Ceiling Functions Solve Nested Recursions Sums of Ceiling Functions Solve Nested Recursions

2011-07-19

arxiv.org/abs/1107.3852v1

Mathematics

Combinatorics

To appear in "Journal of Difference Equations and Applications"

Scientific paper

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)).

Affiliated with

Also associated with

No associations

Rating

Sums of Ceiling Functions Solve Nested Recursions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sums of Ceiling Functions Solve Nested Recursions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sums of Ceiling Functions Solve Nested Recursions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33551