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.

Source : oai:HAL:hal-01179223v1

Volume: Vol. 16 no. 1 (in progress)

Section: Combinatorics

Published on: March 1, 2014

Submitted on: May 21, 2013

Keywords: Discrete Mathematics,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 201 times.

This article's PDF has been downloaded 40 times.