The distribution of longest run lengths in integer compositions
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.