Some simple varieties of trees arising in permutation analysis

After extending classical results on simple varieties of trees to trees counted by their number of leaves, we describe a filtration of the set of permutations based on their strong interval trees. For each subclass we provide asymptotic formulas for number of trees (by leaves), average number of nod...

Descripció completa

Dades bibliogràfiques

Autors principals:	Mathilde Bouvel, Marni Mishna, Cyril Nicaud
Format:	Artigo
Idioma:	Inglês
Publicat:	Discrete Mathematics & Theoretical Computer Science 2013-01-01
Col·lecció:	Discrete Mathematics & Theoretical Computer Science
Matèries:	permutations simple varieties of trees random generation tree parameters asymptotic formulas [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Accés en línia:	https://dmtcs.episciences.org/2346/pdf
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!