Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics

DOI10.1007/978-3-030-50026-9_11OpenAlexW3036401212MaRDI QIDQ5042237

Alexandros Singh, Olivier Bodini, Antoine Genitrini, Mehdi Naima

Publication date: 19 October 2022

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-50026-9_11

zbMATH Keywords

Borel transformasymptotic enumerationincreasing treesanalytic combinatoricsevolution processmonotonic trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of generalized BCI lambda-terms
• On the average shape of monotonically labelled tree structures
• Monotonically labelled Motzkin trees
• Periodic oscillations of coefficients of power series that satisfy functional equations
• On monotone functions of tree structures
• On the number of increasing trees with label repetitions
• Asymptotic enumeration of compacted binary trees of bounded right height
• Ranked Schröder Trees

This page was built for publication: Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics