The distribution of longest run lengths in integer compositions
Combinatorics
2009-06-30 v1
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.
Keywords
Cite
@article{arxiv.0906.5196,
title = {The distribution of longest run lengths in integer compositions},
author = {Herbert S. Wilf},
journal= {arXiv preprint arXiv:0906.5196},
year = {2009}
}