Alternating permutations and binary increasing trees
From MaRDI portal
Publication:1216313
DOI10.1016/0097-3165(75)90002-3zbMath0304.05101OpenAlexW2008418827MaRDI QIDQ1216313
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(75)90002-3
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Permutation groups (20B99)
Related Items (19)
Combinatorial interpretations for TG(1, −1) ⋮ An adjacent-swap Markov chain on coalescent trees ⋮ Context-free grammars for permutations and increasing trees ⋮ Patterns in treeshelves ⋮ Unnamed Item ⋮ On the degree distribution of the nodes in increasing trees ⋮ Bijections for Entringer families ⋮ Alternating permutations and modified Ghandi-polynomials ⋮ 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 ⋮ Lyndon words, permutations and trees. ⋮ More bijections for Entringer and Arnold families ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ Sorting tree, nestling tree and inverse permutation ⋮ The Combinatorics of Polynomial Sequences ⋮ Weakly increasing trees on a multiset ⋮ Counting dendrograms: A survey ⋮ The evolving Moran genealogy
Cites Work
This page was built for publication: Alternating permutations and binary increasing trees
