The first ascent 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, \ldots, a_k$ such that $a_1+a_2+ \cdots +a_k=n$. Let $d$ be a fixed nonnegative integer. We say that we have an ascent of size $d$ or more at position $i$, if $a_{i+1}\geq a_i+d$. We study the average position, initial height and end height of the first ascent of size $d$ or more in compositions of $n$ as $n \to \infty$.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [8 references]

https://hal.inria.fr/hal-01184714
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 17, 2015 - 2:25:22 PM
Last modification on : Wednesday, February 20, 2019 - 4:32:10 PM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:11:02 PM

File

dmAG0118.pdf
Publisher files allowed on an open archive

Identifiers

• HAL Id : hal-01184714, version 1

Citation

Charlotte Brennan, Arnold Knopfmacher. The first ascent of size $d$ or more in compositions. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.261-270. ⟨hal-01184714⟩

Record views