Fringe analysis of plane trees related to cutting and pruning
From MaRDI portal
Publication:2413326
DOI10.1007/s00010-017-0529-0zbMath1383.05017arXiv1704.01095OpenAlexW2604443405MaRDI QIDQ2413326
Sara Kropf, Clemens Heuberger, Benjamin Hackl, Prodinger, Helmut
Publication date: 10 April 2018
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.01095
Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Higher dimensional quasi-power theorem and Berry-Esseen inequality
- Old and young leaves on plane trees
- A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
- Further results on digital search trees
- The average height of binary trees and other simple trees
- The number of registers required for evaluating arithmetic expressions
- On convergence rates in the central limit theorems for combinatorial structures
- A Strahler bijection between Dyck paths and planar trees
- Reductions of binary trees and lattice paths induced by the register function
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
- Random cutting and records in deterministic and random trees
- Cutting down very simple trees
- Singularity Analysis of Generating Functions
- Random Trees
- A note on the stack size of regularly distributed binary trees
- Iterative Cutting and Pruning of Planar Trees
- Central Limit Theorems for Additive Tree Parameters with Small Toll Functions
- Cutting down random trees
This page was built for publication: Fringe analysis of plane trees related to cutting and pruning
