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...
Main Authors: | Mathilde Bouvel, Marni Mishna, Cyril Nicaud |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2013-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2346/pdf |
Similar Items
-
Generating trees for partitions and permutations with no k-nestings
by: Sophie Burrill, et al.
Published: (2012-01-01) -
Enumeration of permutations sorted with two passes through a stack and D_8 symmetries
by: Mathilde Bouvel, et al.
Published: (2012-01-01) -
A relation on 132-avoiding permutation patterns
by: Natalie Aisbett
Published: (2015-12-01) -
Which Schubert varieties are local complete intersections?
by: Henning Úlfarsson, et al.
Published: (2012-01-01) -
Some equinumerous pattern-avoiding classes of permutations
by: M. D. Atkinson
Published: (2005-01-01)