Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics

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

Authors: Olivier Bodini, Antoine Genitrini, Mehdi Naima, A. Singh 

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

asymptotic enumerationanalytic combinatoricsBorel transformevolution processincreasing treesmonotonic trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Analytic combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration of generalized BCI lambda-terms
• On monotone functions of tree structures
• Periodic oscillations of coefficients of power series that satisfy functional equations
• Title not available (Why is that?)
• On the average shape of monotonically labelled tree structures
• Monotonically labelled Motzkin trees
• Asymptotic enumeration of compacted binary trees of bounded right height
• On the number of increasing trees with label repetitions
• Ranked Schröder trees

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042237)