A bijection between ordered trees and 2-Motzkin paths and its many consequences

From MaRDI portal
Publication:1849977

DOI10.1016/S0012-365X(02)00341-2zbMath1012.05050MaRDI QIDQ1849977

Emeric Deutsch, Louis W. Shapiro

Publication date: 2 December 2002

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




Related Items

Parity reversing involutions on plane trees and 2-Motzkin paths, Old and young leaves on plane trees, Protected Branches in Ordered Trees, The statistic ``number of udu's in Dyck paths, Raney numbers, threshold sequences and Motzkin-like paths, Matrix identities on weighted partial Motzkin paths, Unnamed Item, Unnamed Item, On directed lattice paths with vertical steps, Random generation and enumeration of bipartite permutation graphs, Protected points in ordered trees, Generating functions for lattice paths with several forbidden patterns, Unnamed Item, A relation between Schröder paths and Motzkin paths, Bijections of Motzkin paths using shifted Riordan decompositions, Some identities on the Catalan, Motzkin and Schröder numbers, Identities from weighted Motzkin paths, Riordan paths and derangements, Reduction of \(m\)-regular noncrossing partitions, Skew Dyck paths, A history and a survey of lattice path enumeration, Noncrossing normal ordering for functions of boson operators, Ordered trees and the inorder traversal, Riordan arrays, Łukasiewicz paths and Narayana polynomials, Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata, Weakly protected points in ordered trees, Operated semigroups, Motzkin paths and rooted trees, Odd or even on plane trees, Ordered trees with prescribed root degrees, node degrees, and branch lengths, The fine numbers refined, The relevant prefixes of coloured Motzkin walks: an average case analysis, A combinatorial bijection on \(k\)-noncrossing partitions, Motzkin paths, Motzkin polynomials and recurrence relations