Mathematics – Combinatorics
Scientific paper
2009-06-29
Mathematics
Combinatorics
Scientific paper
We find the generating function for $C(n,k,r)$, the number of compositions of
$n$ into $k$ positive parts all of whose runs (contiguous blocks of constant
parts) have lengths less than $r$, using recent generalizations of the method
of Guibas and Odlyzko for finding the number of words that avoid a given list
of subwords.
No associations
LandOfFree
The distribution of longest run lengths in integer compositions 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 The distribution of longest run lengths in integer compositions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The distribution of longest run lengths in integer compositions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-247181