Skip to Main content Skip to Navigation
Journal articles

On the number of increasing trees with label repetitions

Abstract : We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the same label can appear in distinct branches of the tree. In the course of the analysis we develop a method to extract asymptotic information on the coefficients of purely formal power series. The method is based on an approximate Borel transform (or, more generally, Mittag-Leffler transform) which enables us to quickly guess the exponential growth rate. With this guess the sequence is then rescaled and a singularity analysis of the generating function of the scaled counting sequence yields accurate asymptotics. The actual analysis is based on differential equations and a Tauberian argument. The counting problem for trees of size n exhibits interesting asymptotics involving powers of n with irrational exponents.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-02554861
Contributor : Antoine Genitrini <>
Submitted on : Sunday, April 26, 2020 - 8:28:09 PM
Last modification on : Saturday, May 2, 2020 - 1:26:14 AM

File

dm20_genitrini.pdf
Files produced by the author(s)

Identifiers

Citation

Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Stephan Wagner. On the number of increasing trees with label repetitions. Discrete Mathematics, Elsevier, 2019, pp.111722. ⟨10.1016/j.disc.2019.111722⟩. ⟨hal-02554861⟩

Share

Metrics

Record views

26

Files downloads

56