Longest run of equal parts in a random integer composition

From MaRDI portal




Abstract: This note examines a problem in enumerative and asymptotic combinatorics involving the classical structure of integer compositions. What is sought is an analysis on average and in distribution of the length of the longest run of consecutive equal parts in a composition of size n. The problem was recently posed by Herbert Wilf (see arXiv: 0906.5196).









This page was built for publication: Longest run of equal parts in a random integer composition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472973)