Longest Run of Equal Parts in a Random Integer Composition
classification
🧮 math.CO
keywords
compositionequalintegerlongestpartsproblemanalysisarxiv
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.