Counting descents, rises, and levels, with prescribed first element, in words - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2008

Counting descents, rises, and levels, with prescribed first element, in words

Abstract

Recently, Kitaev and Remmel refined the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers which was extended and generalized in several ways in the literature. In this paper, we shall fix a set partition of the natural numbers N,(N1, ..., Ns), and we study the distribution of descents, levels, and rises according to whether the first letter of the descent, rise, or level lies in Ni over the set of words over the alphabet [k] = 1, ..., k. In particular, we refine and generalize some of the results by Burstein and Mansour
Fichier principal
Vignette du fichier
680-3432-1-PB.pdf (214.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00972336 , version 1 (03-04-2014)

Identifiers

Cite

Sergey Kitaev, Toufik Mansour, Jeff Remmel. Counting descents, rises, and levels, with prescribed first element, in words. Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 3 (3), pp.1--22. ⟨10.46298/dmtcs.432⟩. ⟨hal-00972336⟩

Collections

TDS-MACS
62 View
874 Download

Altmetric

Share

Gmail Facebook X LinkedIn More