Nine classes of pattern-avoiding uniquely sorted permutations are enumerated via bijections with Dyck, S-Motzkin, and Schröder paths, confirming Defant's conjectures.
A bijection between ternary trees and a subclass of Motzkin paths
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
A bijection between ternary trees with $n$ nodes and a subclass of Motzkin paths of length $3n$ is given. This bijection can then be generalized to $t$-ary trees.
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
Nine classes of pattern-avoiding uniquely sorted permutations are enumerated via bijections with Dyck, S-Motzkin, and Schröder paths, confirming Defant's conjectures.