Ascents of size less than d in compositions

Maisoon Falah, Toufik Mansour

Research output: Contribution to journalArticlepeer-review

Abstract

A composition of a positive integer n is a finite sequence π1π2...πm of positive integers such that π1+...+πm = n. Let d be a fixed number. We say that we have an ascent of size d or more (respectively, less than d) if πi+1 ≥ πi+d (respectively, πi < πi+1 < πi + d). Recently, Brennan and Knopfmacher determined the mean, variance and limiting distribution of the number of ascents of size d or more in the set of compositions of n. In this paper, we find an explicit formula for the multi-variable generating function for the number of compositions of n according to the number of parts, ascents of size d or more, ascents of size less than d, descents and levels. Also, we extend the results of Brennan and Knopfmacher to the case of ascents of size less than d. More precisely, we determine the mean, variance and limiting distribution of the number of ascents of size less than d in the set of compositions of n.

Original languageAmerican English
Pages (from-to)196-203
Number of pages8
JournalCentral European Journal of Mathematics
Volume9
Issue number1
DOIs
StatePublished - 2011

Keywords

  • Ascents
  • Compositions
  • Descents
  • Distributions
  • Generating functions
  • Levels

All Science Journal Classification (ASJC) codes

  • General Mathematics

Fingerprint

Dive into the research topics of 'Ascents of size less than d in compositions'. Together they form a unique fingerprint.

Cite this