Counting descents, rises, and levels, with prescribed first element, in words
| dc.creator | Kitaev, Sergey | |
| dc.creator | Mansour, Toufik | |
| dc.creator | Remmel, Jeffrey B. | |
| dc.date | 2006-12-31 | |
| dc.date | 2007-05-30 | |
| dc.date.accessioned | 2026-07-07T08:08:33Z | |
| dc.date.available | 2026-07-07T08:08:33Z | |
| dc.description | Recently, Kitaev and Remmel [Classifying descents according to parity, Annals of Combinatorics, to appear 2007] refined the well-known permutation statistic ``descent'' by fixing parity of one of the descent's numbers. Results in that paper were extended and generalized in several ways. In this paper, we shall fix a set partition of the natural numbers $N$, $(N_1, ..., N_t)$, and we study the distribution of descents, levels, and rises according to whether the first letter of the descent, rise, or level lies in $N_i$ over the set of words over the alphabet $[k]$. In particular, we refine and generalize some of the results in [Counting occurrences of some subword patterns, Discrete Mathematics and Theoretical Computer Science 6 (2003), 001-012.]. | |
| dc.description | 20 pages, sections 3 and 4 are added | |
| dc.identifier | https://arxiv.org/abs/math/0701032 | |
| dc.identifier | http://arxiv.org/abs/math/0701032 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131301 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15 | |
| dc.title | Counting descents, rises, and levels, with prescribed first element, in words | |
| dc.type | text |