Pages that link to "Item:Q1224099"
From MaRDI portal
The following pages link to On a correspondence between binary trees and a certain type of permutation (Q1224099):
Displayed 15 items.
- An infinite family of inv-Wilf-equivalent permutation pairs (Q472398) (← links)
- Counting permutations with no long monotone subsequence via generating trees and the kernel method (Q536566) (← links)
- Inversion formulae on permutations avoiding 321 (Q895062) (← links)
- Permutation representation of k-ary trees (Q1062460) (← links)
- Stack sortable permutations (Q1170191) (← links)
- Forbidden subsequences (Q1336669) (← links)
- Permutations generated by token passing in graphs (Q1391529) (← links)
- A new class of Wilf-equivalent permutations (Q1604771) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- The Catalan combinatorics of the hereditary artin algebras (Q3178948) (← links)
- (Q3679220) (← links)
- A note on generating binary trees in<i>A</i>-order and<i>B</i>-order (Q3802638) (← links)
- Coding Binary Trees by Words over an Alphabet with Four Letters (Q4024145) (← links)
- Generation of<i>t</i>-ary trees with Ballot-sequences<sup>*</sup> (Q4462115) (← links)
- Recent progress in algebraic combinatorics (Q4780390) (← links)