Upper Bound on the recurrence T(n,m) = T(n-1,m)+T(n-1,m-1)-T(n-km,m-km) , where k is a constant, 0 < k < 1
What is a tight upper bound on the recurrence T(n,m) = T(n-1,m)+T(n-1,m-1)-T(n-km,m-km), where T(x,y) = 0 if any of x or y is negative? Assume that n>m>k and k is a constant, 0 < k < 1.

I know that the upper bound is a Choose (n,m). But a more tight upper bound in terms of k would be nice.


Upper Bound on the recurrence T(n,m) = T(n-1,m)+T(n-1,m-1)-T(n-km,m-km) , where k is a constant, 0 < k < 1
===

What is a tight upper bound on the recurrence T(n,m) = T(n-1,m)+T(n-1,m-1)-T(n-km,m-km), where T(x,y) = 0 if any of x or y is negative? Assume that n>m>k and k is a constant, 0 < k < 1.

I know that the upper bound is a Choose (n,m). But a more tight upper bound in terms of k would be nice.

