pith. sign in

arxiv: 1609.09586 · v1 · pith:47R6FO7Snew · submitted 2016-09-30 · 🧮 math.CO

Some families of trees arising in permutation analysis

classification 🧮 math.CO
keywords treesasymptoticbehaviorfiltrationintervalresultsstronganalysis
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.