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...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	Mathilde Bouvel, Marni Mishna, Cyril Nicaud
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	Discrete Mathematics & Theoretical Computer Science 2013-01-01
סדרה:	Discrete Mathematics & Theoretical Computer Science
נושאים:	permutations simple varieties of trees random generation tree parameters asymptotic formulas [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
גישה מקוונת:	https://dmtcs.episciences.org/2346/pdf
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!