A refined bijection between alternating permutations and 0-1-2 increasing trees
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2010
- DOI:
- 10.48550/arXiv.1003.4564
- arXiv:
- arXiv:1003.4564
- Bibcode:
- 2010arXiv1003.4564S
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- 4 pages, 1 figures