The descent statistic on 123-avoiding permutations
zbMATH Open1267.05004arXiv0910.0963MaRDI QIDQ846052FDOQ846052
Flavio Bonetti, Matteo Silimbani, Marilena Barnabei
Publication date: 29 January 2010
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.0963
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Bernoulli and Euler numbers and polynomials (11B68)
Cited In (18)
- Descent sets on 321-avoiding involutions and hook decompositions of partitions
- Consecutive patterns in Catalan words and the descent distribution
- Refining enumeration schemes to count according to permutation statistics
- $k$-Arrangements, Statistics, and Patterns
- The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2
- \((p, q, t)\)-Catalan continued fractions, gamma expansions and pattern avoidances
- The pure descent statistic on permutations
- Distributions of Statistics over Pattern-Avoiding Permutations
- Non-overlapping descents and ascents in stack-sortable permutations
- Refined Wilf-equivalences by Comtet statistics
- Restricted generating trees for weak orderings
- Unimodal permutations and almost-increasing cycles
- Ordered partitions avoiding a permutation pattern of length 3
- Stack-sorting preimages of permutation classes
- Refined restricted inversion sequences
- The descent statistic on involutions is not log-concave
- Ascending runs in permutations and valued Dyck paths
- Distributions of statistics on separable permutations
Uses Software
This page was built for publication: The descent statistic on 123-avoiding permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846052)