Mathematics – Combinatorics
Scientific paper
2010-06-10
J. Integer Seq. 13 (2010), no. 9, Article 10.9.2, 20 pp
Mathematics
Combinatorics
16 pages, TikZ figures, includes Sage code
Scientific paper
Kim and Drake used generating functions to prove that the number of 2-distant noncrossing matchings, which are in bijection with little Schroeder paths, is the same as the weight of Dyck paths in which downsteps from even height have weight 2. This work presents bijections from those Dyck paths to little Schroeder paths, and from a similar set of Dyck paths to big Schroeder paths. We show the effect of these bijections on the corresponding matchings, find generating functions for two new classes of lattice paths, and demonstrate a relationship with 231-avoiding permutations.
No associations
LandOfFree
Bijections from weighted Dyck paths to Schroeder paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bijections from weighted Dyck paths to Schroeder paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bijections from weighted Dyck paths to Schroeder paths will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-490613