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.
Parity statistics on restricted permutations and the Catalan--Schett polynomials
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Motivated by Kitaev and Zhang's recent work on non-overlapping ascents in stack-sortable permutations and Dumont's permutation interpretation of the Jacobi elliptic functions, we investigate some parity statistics on restricted permutations. Some new related bijections are constructed and two refinements of the generating function for descents over $321$-avoiding permutations due to Barnabei, Bonetti and Silimbanian are obtained. In particular, an open problem of Kitaev and Zhang about non-overlapping ascents on $321$-avoiding permutations is solved and several combinatorial interpretations for the Catalan--Schett polynomials are found. The stack-sortable permutations are at the heart of our approaches.
citation-role summary
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.