The pure descent statistic on permutations
From MaRDI portal
Publication:2012552
DOI10.1016/j.disc.2017.06.005zbMath1367.05004OpenAlexW2734245504MaRDI QIDQ2012552
Jean-Luc Baril, Sergey Kirgizov
Publication date: 1 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.06.005
Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Permutations, words, matrices (05A05)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Patterns in permutations and words.
- Pattern frequency sequences and internal zeros
- The descent statistic on 123-avoiding permutations
- Gray code for permutations with a fixed number of cycles
- Statistics-preserving bijections between classical and cyclic permutations
- Pattern popularity in 132-avoiding permutations
- Generating trees for permutations avoiding generalized patterns
- Combinatorics of Permutations
- A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
- The On-Line Encyclopedia of Integer Sequences
- Restricted permutations
- Permutations with restricted patterns and Dyck paths
This page was built for publication: The pure descent statistic on permutations