The descent statistic on 123-avoiding permutations

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

zbMATH Keywords

Eulerian numbersDyck pathsrestricted permutations123-avoiding permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05)

Related Items (15)

Unimodal permutations and almost-increasing cycles ⋮ Restricted generating trees for weak orderings ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ Consecutive patterns in Catalan words and the descent distribution ⋮ Non-overlapping descents and ascents in stack-sortable permutations ⋮ Stack-sorting preimages of permutation classes ⋮ Ordered partitions avoiding a permutation pattern of length 3 ⋮ $k$-Arrangements, Statistics, and Patterns ⋮ Descent sets on 321-avoiding involutions and hook decompositions of partitions ⋮ Refined restricted inversion sequences ⋮ The pure descent statistic on permutations ⋮ The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 ⋮ Refined Wilf-equivalences by Comtet statistics ⋮ Ascending runs in permutations and valued Dyck paths ⋮ Distributions of Statistics over Pattern-Avoiding Permutations

Uses Software

• OEIS

This page was built for publication: The descent statistic on 123-avoiding permutations