A refined bijection between alternating permutations and 0-1-2 increasing trees
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:Q365S65Vrecord.jsonopen to challenge →
classification
math.CO
keywords
alternatingbijectionfirstincreasingpermutationsrefinedtreesconstruct
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.