Unimodal permutations and almost-increasing cycles
From MaRDI portal
Publication:2409827
zbMath1372.05001MaRDI QIDQ2409827
Kassie Archer, L. K. Lauderdale
Publication date: 16 October 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p63
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items
Unimodal permutations and almost-increasing cycles, Enumerating two permutation classes by the number of cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Descents of \(\lambda\)-unimodal cycles in a character formula
- Analysis of casino shelf shuffling machines
- Refining enumeration schemes to count according to permutation statistics
- Permutation patterns and statistics
- Descent sets on 321-avoiding involutions and hook decompositions of partitions
- Matrices, characters and descents
- The X-class and almost-increasing permutations
- Mahonian pairs
- Fixed points and excedances in restricted permutations
- Descent sets of cyclic permutations
- The descent statistic on 123-avoiding permutations
- Alternating permutations and symmetric functions
- Inversion formulae on permutations avoiding 321
- On bijections for pattern-avoiding permutations
- Counting permutations with given cycle structure and descent set
- On the diagram of 132-avoiding permutations
- The cycle enumerator of unimodal permutations
- Multiple pattern avoidance with respect to fixed points and excedances
- Unimodal permutations and almost-increasing cycles
- Cyclic permutations realized by signed shifts
- Cycle up-down permutations
- The Number of Permutations Realized By a Shift
- The cyclic structure of unimodal permutations