On a correspondence between binary trees and a certain type of permutation
From MaRDI portal
Publication:1224099
DOI10.1016/0020-0190(75)90002-2zbMath0323.05006OpenAlexW2029005417MaRDI QIDQ1224099
Publication date: 1975
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(75)90002-2
Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)
Related Items
Recent progress in algebraic combinatorics, Forbidden subsequences, A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations, The Catalan combinatorics of the hereditary artin algebras, Coding Binary Trees by Words over an Alphabet with Four Letters, Permutations generated by token passing in graphs, Inversion formulae on permutations avoiding 321, Stack sortable permutations, A note on generating binary trees inA-order andB-order, An infinite family of inv-Wilf-equivalent permutation pairs, Unnamed Item, Counting permutations with no long monotone subsequence via generating trees and the kernel method, Generation oft-ary trees with Ballot-sequences*, Permutation representation of k-ary trees, A new class of Wilf-equivalent permutations
Cites Work