The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2

DOI10.1016/j.ejc.2009.11.011zbMath1230.05016WikidataQ60692173 ScholiaQ60692173MaRDI QIDQ976157

Flavio Bonetti, Marilena Barnabei, Matteo Silimbani

Publication date: 17 June 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.11.011

zbMATH Keywords

involution on Dyck paths; Krattenthaler's bijection

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05A19: Combinatorial identities, bijective combinatorics

05A05: Permutations, words, matrices

Related Items

Visibility in pattern-restricted permutations, Ascending runs in permutations and valued Dyck paths, Refining enumeration schemes to count according to permutation statistics, Descent sets on 321-avoiding involutions and hook decompositions of partitions, The equidistribution of some length-three vincular patterns on \(S_n(132)\), Counting pattern avoiding permutations by number of movable letters

Uses Software

• OEIS

Cites Work

• OEIS
• On bijections between 231-avoiding permutations and Dyck paths
• The descent statistic on 123-avoiding permutations
• The \(q\)-exponential generating function for permutations by consecutive patterns and inversions
• Permutations and words counted by consecutive patterns
• Introduction to partially ordered patterns
• An involution on Dyck paths and its consequences
• Dyck path enumeration
• Consecutive patterns in permutations
• Generalized permutation patterns and a classification of the Mahonian statistics
• Restricted 1-3-2 permutations and generalized patterns
• Counting strings in Dyck paths
• On uniquely \(k\)-determined permutations
• Permutations avoiding consecutive patterns. II
• Asymptotic enumeration of permutations avoiding generalized patterns
• Classification of bijections between 321- and 132-avoiding permutations
• The Eulerian numbers on restricted centrosymmetric permutations
• Restricted permutations
• Generalized pattern avoidance
• Permutations with restricted patterns and Dyck paths
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item