A max-tree mapping on d-permutations avoiding (21,12) and 231 is bijective with d-ary trees, resolving a conjecture on their enumeration.
Discrete Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Max-tree for d-permutations and pattern avoidance
A max-tree mapping on d-permutations avoiding (21,12) and 231 is bijective with d-ary trees, resolving a conjecture on their enumeration.