Some families of trees arising in permutation analysis - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue The Electronic Journal of Combinatorics Année : 2020

Some families of trees arising in permutation analysis

Résumé

We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these results to strong interval trees with a restriction on the arity of prime nodes. Doing so, we describe a filtration of the set of permutations based on their strong interval trees. This filtration is also studied from a purely analytical point of view, thus illustrating the convergence of analytic series towards a non-analytic limit at the level of the asymptotic behavior of their coefficients.

Dates et versions

hal-03002214 , version 1 (12-11-2020)

Identifiants

Citer

Mathilde Bouvel, Marni Mishna, Cyril Nicaud. Some families of trees arising in permutation analysis. The Electronic Journal of Combinatorics, 2020, ⟨10.37236/6504⟩. ⟨hal-03002214⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More