The following pages link to Descent sets of cyclic permutations (Q719785):
Displaying 11 items.
- Descents of \(\lambda\)-unimodal cycles in a character formula (Q294521) (← links)
- Characterization of the allowed patterns of signed shifts (Q516799) (← links)
- Permutations and \(\beta \)-shifts (Q640857) (← links)
- Monotonous subsequences and the descent process of invariant random permutations (Q1722013) (← links)
- Plethystic formulas for permutation enumeration (Q2213771) (← links)
- Unimodal permutations and almost-increasing cycles (Q2409827) (← links)
- Exact and asymptotic enumeration of cyclic permutations according to descent set (Q2424916) (← links)
- The number of cycles with a given descent set (Q2632722) (← links)
- Allowed Patterns of Symmetric Tent Maps via Commuter Functions (Q2968514) (← links)
- Transformation à la Foata for special kinds of descents and excedances (Q5054901) (← links)
- Involutions and the Gelfand character (Q6100542) (← links)
