Skip to Main content Skip to Navigation
Journal articles

The distribution of ascents of size d or more in compositions

Abstract : A composition of a positive integer n is a finite sequence of positive integers a(1), a(2), ..., a(k) such that a(1) + a(2) + ... + a(k) = n. Let d be a fixed nonnegative integer. We say that we have an ascent of size d or more if a(i+1) >= a(i) + d. We determine the mean, variance and limiting distribution of the number of ascents of size d or more in the set of compositions of n. We also study the average size of the greatest ascent over all compositions of n.
Document type :
Journal articles
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, May 7, 2014 - 4:13:13 PM
Last modification on : Wednesday, February 20, 2019 - 4:32:10 PM
Long-term archiving on: : Thursday, August 7, 2014 - 11:35:12 AM


Files produced by the author(s)


  • HAL Id : hal-00988184, version 1



Charlotte Brennan, Arnold Knopfmacher. The distribution of ascents of size d or more in compositions. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2009, 11 (1), pp.1--10. ⟨hal-00988184⟩



Record views


Files downloads