Counting nondecreasing integer sequences that lie below a barrier

Details Counting nondecreasing integer sequences that lie below a barrier Counting nondecreasing integer sequences that lie below a barrier

2009-05-05

arxiv.org/abs/0905.0609v2

Mathematics

Combinatorics

Scientific paper

Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n \times n$ determinant whose entries are binomial coefficients (Kreweras, 1965) and, in the special case of $b_j = rj+s$, a short explicit formula (Proctor, 1988, p.320). A relatively easy bivariate recursion, decomposing all sequences according to $n$ and $a_n$, leads to a bivariate generating function, then a univariate generating function, then a linear recursion for $\{f(n) \}$. Moreover, the coefficients of the bivariate generating function have a probabilistic interpretation, leading to an analytic inequality which is an identity for certain values of its argument.

Affiliated with

Also associated with

No associations

Rating

Counting nondecreasing integer sequences that lie below a barrier 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 Counting nondecreasing integer sequences that lie below a barrier, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting nondecreasing integer sequences that lie below a barrier will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-450720