The distribution of longest run lengths in integer compositions
arXiv:0906.5196
Abstract
We find the generating function for , the number of compositions of into positive parts all of whose runs (contiguous blocks of constant parts) have lengths less than , using recent generalizations of the method of Guibas and Odlyzko for finding the number of words that avoid a given list of subwords.