Authors: Aubrey Blecher ¹; Charlotte Brennan ¹; Arnold Knopfmacher ¹

• 1 The John Knopfmacher Centre for Applicable Analysis and Number Theory [Johannesburg]

Combinatorics

[en]
We consider compositions of n, i.e., sequences of positive integers (or parts) (σi)i=1k where σ1+σ2+...+σk=n. We define a maximum to be any part which is not less than any other part. The variable of interest is the size of the descent immediately following the first and the last maximum. Using generating functions and Mellin transforms, we obtain asymptotic expressions for the average size of these descents. Finally, we show with the use of a simple bijection between the compositions of n for n>1, that on average the descent after the last maximum is greater than the descent after the first.