Skip to Main content Skip to Navigation
Journal articles

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
Document type :
Journal articles
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00972336
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, April 3, 2014 - 4:13:36 PM
Last modification on : Monday, August 24, 2020 - 3:42:06 PM
Long-term archiving on: : Thursday, July 3, 2014 - 4:40:52 PM

File

680-3432-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00972336, version 1

Collections

Citation

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

Share

Metrics

Record views

278

Files downloads

1031