Classifying descents according to equivalence mod k
zbMATH Open1097.05003arXivmath/0604455MaRDI QIDQ2500983FDOQ2500983
Authors: Sergey Kitaev, Jeffrey Remmel
Publication date: 30 August 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0604455
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Classifying descents according to parity
- Counting descents and ascents relative to equivalence classes mod \(k\)
- Equivalence classes of permutations modulo descents and left-to-right maxima
- Equidistribution of descents, adjacent pairs, and place-value pairs on permutations
- On counting permutations by pairs of congruence classes of major index
Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05)
Cited In (9)
- Counting descents, rises, and levels, with prescribed first element, in words
- Enumeration of Dumont permutations avoiding certain four-letter patterns
- Classifying descents according to parity
- The homogenized linial arrangement and Genocchi numbers
- Equivalence classes of permutations modulo descents and left-to-right maxima
- Equidistribution of descents, adjacent pairs, and place-value pairs on permutations
- The combinatorics of Jeff Remmel
- Counting descent pairs with prescribed tops and bottoms
- Counting descents and ascents relative to equivalence classes mod \(k\)
This page was built for publication: Classifying descents according to equivalence \(\operatorname{mod} k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500983)