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

Heesung Shin

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

Combinatorics 2010-03-25 v1

Authors: Heesung Shin

Abstract

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

Keywords

bijective combinatorics permutations phylogenetic trees

Cite

@article{arxiv.1003.4564,
  title  = {A refined bijection between alternating permutations and 0-1-2 increasing trees},
  author = {Heesung Shin},
  journal= {arXiv preprint arXiv:1003.4564},
  year   = {2010}
}

Comments

4 pages, 1 figures

Related papers

View all related →