Cycles in the graph of overlapping permutations avoiding barred patterns

zbMath1351.05130MaRDI QIDQ727057

Guizhi Qin, Sherry H. F. Yan

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i3p56

zbMATH Keywords

cyclesMotzkin pathsgraph of overlapping permutationsRiordan paths

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A spectral approach to consecutive pattern-avoiding permutations
• Number of cycles in the graph of 312-avoiding permutations
• Patterns in permutations and words.
• Universal cycles for combinatorial structures
• Catalan, Motzkin, and Riordan numbers
• Dyck path enumeration
• Some combinatorial properties of Schubert polynomials
• Motzkin paths and reduced decompositions for permutations with forbidden patterns
• Affine permutations of type \(A\)
• Juggling and applications to \(q\)-analogues
• Enumerating pattern avoidance for affine permutations
• From Motzkin to Catalan permutations
• On uniquely \(k\)-determined permutations
• Riordan paths and derangements
• Handbook of Enumerative Combinatorics
• Motzkin numbers

This page was built for publication: Cycles in the graph of overlapping permutations avoiding barred patterns