The descent statistic on 123-avoiding permutations
From MaRDI portal
Publication:846052
zbMath1267.05004arXiv0910.0963MaRDI QIDQ846052
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
05A15: Exact enumeration problems, generating functions
05A19: Combinatorial identities, bijective combinatorics
11B68: Bernoulli and Euler numbers and polynomials
05A05: Permutations, words, matrices
Related Items
Distributions of Statistics over Pattern-Avoiding Permutations, $k$-Arrangements, Statistics, and Patterns, Ascending runs in permutations and valued Dyck paths, Refined restricted inversion sequences, Restricted generating trees for weak orderings, Consecutive patterns in Catalan words and the descent distribution, Refining enumeration schemes to count according to permutation statistics, Descent sets on 321-avoiding involutions and hook decompositions of partitions, The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2, The pure descent statistic on permutations, Refined Wilf-equivalences by Comtet statistics, Stack-sorting preimages of permutation classes, Unimodal permutations and almost-increasing cycles, Ordered partitions avoiding a permutation pattern of length 3
Uses Software
