A refined bijection between alternating permutations and 0-1-2 increasing trees

2010/03/24 by Shin, Heesung
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1003.4564

Abstract

We construct a refined bijection ϕ between alternating permutations and 0-1-2 increasing trees with degree at most 2. It satisfies that the first element of alternating permutation π is equal to the first vertex in ϕ(π) in the postorder.

Related

• A bijection between vertices of rank 1 in increasing trees and derangements
• Bijections in weakly increasing trees via binary trees
• Permutation graphs and the Abelian sandpile model, tiered trees and non-ambiguous binary trees
• Increasing Trees and the Degree-Chromatic Polynomial
• Complete non-ambiguous trees and associated permutations: new enumerative results