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

From MaRDI portal
Revision as of 11:05, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (33)

Parity reversing involutions on plane trees and 2-Motzkin pathsOld and young leaves on plane treesProtected Branches in Ordered TreesThe statistic ``number of udu's in Dyck pathsRaney numbers, threshold sequences and Motzkin-like pathsMatrix identities on weighted partial Motzkin pathsUnnamed ItemUnnamed ItemOn directed lattice paths with vertical stepsRandom generation and enumeration of bipartite permutation graphsProtected points in ordered treesGenerating functions for lattice paths with several forbidden patternsUnnamed ItemA relation between Schröder paths and Motzkin pathsBijections of Motzkin paths using shifted Riordan decompositionsSome identities on the Catalan, Motzkin and Schröder numbersIdentities from weighted Motzkin pathsRiordan paths and derangementsReduction of \(m\)-regular noncrossing partitionsSkew Dyck pathsA history and a survey of lattice path enumerationNoncrossing normal ordering for functions of boson operatorsOrdered trees and the inorder traversalRiordan arrays, Łukasiewicz paths and Narayana polynomialsAnalytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automataWeakly protected points in ordered treesOperated semigroups, Motzkin paths and rooted treesOdd or even on plane treesOrdered trees with prescribed root degrees, node degrees, and branch lengthsThe fine numbers refinedThe relevant prefixes of coloured Motzkin walks: an average case analysisA combinatorial bijection on \(k\)-noncrossing partitionsMotzkin paths, Motzkin polynomials and recurrence relations







This page was built for publication: A bijection between ordered trees and 2-Motzkin paths and its many consequences