Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics

DOI10.1007/978-3-030-50026-9_11MaRDI QIDQ5042237zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 2127738 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 1080355 (Why is no real title available?)
• scientific article; zbMATH DE number 3216527 (Why is no real title available?)
• Analytic combinatorics
• Asymptotic enumeration of compacted binary trees of bounded right height
• Enumeration of generalized BCI lambda-terms
• Monotonically labelled Motzkin trees
• On monotone functions of tree structures
• On the average shape of monotonically labelled tree structures
• On the number of increasing trees with label repetitions
• Periodic oscillations of coefficients of power series that satisfy functional equations
• 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)