Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths

DOI10.1016/j.disc.2013.12.007zbMath1281.05006arXiv1208.1075MaRDI QIDQ394358

Thi Thu Huong Tran, Dominique Rossin, Phan Thuan Do

Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.1075

zbMATH Keywords

Motzkin paths; Dyck paths; barred pattern; restricted permutations; weak avoidance of barred patterns

Mathematics Subject Classification ID

05A05: Permutations, words, matrices

Related Items

Combinatorial generation via permutation languages. I. Fundamentals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Classical sequences revisited with permutations avoiding dotted pattern
• On bijections between 231-avoiding permutations and Dyck paths
• Dyck path enumeration
• Generalized permutation patterns and a classification of the Mahonian statistics
• Restricted permutations and the wreath product
• Generating trees and the Catalan and Schröder numbers
• From Motzkin to Catalan permutations
• Enumeration schemes for permutations avoiding barred patterns
• Enumerating permutations avoiding three Babson-Steingrímsson patterns
• Restricted permutations
• Permutations with restricted patterns and Dyck paths