On the number of increasing trees with label repetitions - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics Year : 2020

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.
Fichier principal
Vignette du fichier
dm20_genitrini.pdf (484.46 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02554861 , version 1 (26-04-2020)

Identifiers

Cite

Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Stephan Wagner. On the number of increasing trees with label repetitions. Discrete Mathematics, 2020, 343 (8), pp.111722. ⟨10.1016/j.disc.2019.111722⟩. ⟨hal-02554861⟩
48 View
45 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More