![]() |
Discrete Mathematics & Theoretical Computer Science |
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
Source : ScholeXplorer
IsRelatedTo ARXIV math/0604455 Source : ScholeXplorer IsRelatedTo DOI 10.37236/1090 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.math/0604455
|