Switching left and right branches in binary trees yields new bijections on weakly increasing trees, reproving and generalizing known symmetries on plane trees and 312-avoiding permutations.
Chen, A general bijective algorithm for trees, Pr oc
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Bijections in weakly increasing trees via binary trees
Switching left and right branches in binary trees yields new bijections on weakly increasing trees, reproving and generalizing known symmetries on plane trees and 312-avoiding permutations.