Enumerations of plane trees with multiple edges and Raney lattice paths

DOI10.1016/j.disc.2014.07.024zbMath1301.05178OpenAlexW1996946982MaRDI QIDQ465269

Maciej Dziemiańczuk

Publication date: 31 October 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2014.07.024

zbMATH Keywords

lattice pathsenumeration of plane treesRaney lemma

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

The height of multiple edge plane trees, The \(\mathfrak{uvu}\)-avoiding \((a, b, c)\)-generalized Motzkin paths with vertical steps: bijections and statistic enumerations, On directed lattice paths with vertical steps

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multivariate Fuss-Catalan numbers
• Bijections for 2-plane trees and ternary trees
• The average height of planted plane trees with M leaves
• Ordered trees and non-crossing partitions
• Enumerations of ordered trees
• Combinatorial aspects of continued fractions
• Catalan numbers, their generalization, and their uses
• Cumulants, lattice paths, and orthogonal polynomials
• Densities of the Raney distributions
• The probability measure corresponding to 2-plane trees
• Functional Composition Patterns and Power Series Reversion
• Correspondences between plane trees and binary sequences