Riordan paths and derangements

DOI10.1016/j.disc.2007.05.001zbMath1147.05008arXivmath/0602298OpenAlexW2108437740MaRDI QIDQ2483401

Laura L. M. Yang, Eva Y. P. Deng, William Y. C. Chen

Publication date: 28 April 2008

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

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

zbMATH Keywords

(321,3\(\bar 1\)42)-avoiding derangementRiordan numberRiordan path

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Paths and cycles (05C38)

Related Items

Pattern avoidance of generalized permutations, Unnamed Item, Disjoint compatibility graph of non-crossing matchings of points in convex position, Cycles in the graph of overlapping permutations avoiding barred patterns

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Bijective recurrences concerning Schröder paths
• Catalan, Motzkin, and Riordan numbers
• A classic proof of a recurrence for a very classical sequence
• Motzkin paths and reduced decompositions for permutations with forbidden patterns
• A bijection between ordered trees and 2-Motzkin paths and its many consequences
• A general bijective algorithm for trees.
• Three recurrences for parallelogram polyominoes
• Motzkin numbers
• Bijective recurrences for Motzkin paths