On the evolution of random integer compositions

Tools

Bevan, David and Threlfall, Dan (2025) On the evolution of random integer compositions. The Electronic Journal of Combinatorics, 32 (1). 1.21. ISSN 1077-8926 (https://doi.org/10.37236/13010)

[thumbnail of Bevan-Threlfall-EJC-2025-On-the-evolution-of-random-integer]
Preview
 Text. Filename: Bevan-Threlfall-EJC-2025-On-the-evolution-of-random-integer.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (988kB)| Preview

Abstract

We explore how the asymptotic structure of a random n-term weak integer composition of m evolves, as m increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures. These include the longest and shortest runs of zero terms or of nonzero terms, longest increasing runs, longest runs of equal terms, largest squares (runs of k terms each equal to k), as well as a wide variety of other patterns. Of particular note is the dichotomy between the appearance and disappearance of exact consecutive patterns, with smaller patterns appearing before larger ones, whereas longer patterns disappear before shorter ones.

ORCID iDs

Bevan, David ORCID logoORCID: https://orcid.org/0000-0001-7179-2285 and Threlfall, Dan;
CORE (COnnecting REpositories)