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