Sergey Kitaev ; Toufik Mansour ; Jeff Remmel - Counting descents, rises, and levels, with prescribed first element, in words

dmtcs:432 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, Vol. 10 no. 3 - https://doi.org/10.46298/dmtcs.432
Counting descents, rises, and levels, with prescribed first element, in words

Authors: Sergey Kitaev ORCID-iD; Toufik Mansour ORCID-iD; Jeff Remmel

    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


    Volume: Vol. 10 no. 3
    Section: Combinatorics
    Published on: January 1, 2008
    Imported on: March 26, 2015
    Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
    Fundings :
      Source : OpenAIRE Research Graph
    • Combinatorial Structures for Permutation Enumeration and Macdonald Polynomials; Funder: National Science Foundation; Code: 0654060

    Share

    Consultation statistics

    This page has been seen 197 times.
    This article's PDF has been downloaded 146 times.