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

Sergey Kitaev (1) , Toufik Mansour (2) , Jeff Remmel (3)

1 School of Computer Science - The Mathematics Institute, Reyjavik University
2 Department of Mathematics [Haïfa]
3 MATH - UC San Diego - Department of Mathematics [Univ California San Diego]

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

Domaines: Mathématique discrète [cs.DM]

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⟩