Longest run of equal parts in a random integer composition

From MaRDI portal
Publication:472973

DOI10.1016/J.DISC.2014.10.003zbMATH Open1303.05009arXiv0907.5553OpenAlexW2140083166MaRDI QIDQ472973FDOQ472973


Authors: Ayla Gafni Edit this on Wikidata


Publication date: 20 November 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

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).


Full work available at URL: https://arxiv.org/abs/0907.5553




Recommendations




Cites Work


Cited In (3)





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)