Alternating permutations and binary increasing trees
From MaRDI portal
Cites work
Cited in
(22)- Alternating permutations and modified Ghandi-polynomials
- Sorting tree, nestling tree and inverse permutation
- Lyndon words, permutations and trees.
- Weakly increasing trees on a multiset
- More bijections for Entringer and Arnold families
- The evolving Moran genealogy
- Patterns in treeshelves
- Combinatorial interpretations for T_G(1, - 1)
- Context-free grammars for permutations and increasing trees
- The Combinatorics of Polynomial Sequences
- Combinatorial families of multilabelled increasing trees and hook-length formulas
- An adjacent-swap Markov chain on coalescent trees
- Motzkin paths with a restricted first return decomposition
- Bijections for Entringer families
- A combinatorial link between labelled graphs and increasingly labelled Schröder trees
- Three new refined Arnold families
- On distribution of the number of peaks and the Euler numbers of permutations
- A duality for labeled graphs and factorizations with applications to graph embeddings and Hurwitz enumeration
- Uniform attachment with freezing
- The statistics and combinatorics of increasing trees and colored increasing trees
- Counting dendrograms: A survey
- On the degree distribution of the nodes in increasing trees
This page was built for publication: Alternating permutations and binary increasing trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1216313)