Pages that link to "Item:Q2424916"
From MaRDI portal
The following pages link to Exact and asymptotic enumeration of cyclic permutations according to descent set (Q2424916):
Displaying 14 items.
- Counting simsun permutations by descents (Q659654) (← links)
- Descent sets of cyclic permutations (Q719785) (← links)
- Counting permutations with given cycle structure and descent set (Q1318366) (← links)
- Cyclic permutations: degrees and combinatorial types (Q2049453) (← links)
- Counting permutations by peaks, descents, and cycle type (Q2199803) (← links)
- Plethystic formulas for permutation enumeration (Q2213771) (← links)
- Enumerations of permutations by circular descent sets (Q2279386) (← links)
- MacMahon's theorem for a set of permutations with given descent indices and right-maximal records (Q2380467) (← links)
- Unimodal permutations and almost-increasing cycles (Q2409827) (← links)
- The number of cycles with a given descent set (Q2632722) (← links)
- Cycles on a multiset with only even-odd drops (Q2666580) (← links)
- Enumerating two permutation classes by the number of cycles (Q6102520) (← links)
- Higher Lie characters and cyclic descent extension on conjugacy classes (Q6119515) (← links)
- Higher Lie characters and cyclic descent extension on conjugacy classes (Q6161703) (← links)