The height of multiple edge plane trees
From MaRDI portal
Publication:291297
DOI10.1007/s00010-015-0380-0zbMath1337.05055arXiv1503.04749OpenAlexW1942124093WikidataQ59463244 ScholiaQ59463244MaRDI QIDQ291297
Clemens Heuberger, Stephan G. Wagner, Prodinger, Helmut
Publication date: 7 June 2016
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.04749
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16)
Related Items
Batcher's odd-even exchange revisited: a generating functions approach ⋮ Partial skew Dyck paths: a kernel method approach ⋮ Retakh's Motzkin paths and some combinatorial comments ⋮ Enumeration of partial Łukasiewicz paths
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerations of plane trees with multiple edges and Raney lattice paths
- Mellin transforms and asymptotics: Harmonic sums
- Mathematics for the Analysis of Algorithms.
- The average height of planted plane trees with M leaves
- The average height of r-tuply rooted planted plane trees
- A note on a result of R. Kemp on r-tuply rooted planted plane trees
- The average height of binary trees and other simple trees
- On convergence rates in the central limit theorems for combinatorial structures
- Singularity Analysis of Generating Functions
- Random Trees
- Register Allocation for Unary–Binary Trees
- The Distribution of Heights of Binary Trees and Other Simple Trees
- A lattice of combinatorial Hopf algebras, Application to binary trees with multiplicities