A general bijective algorithm for trees.

DOI10.1073/PNAS.87.24.9635MaRDI QIDQ3487361zbMATH OpenOpenAlexWikidataFDO

Authors William Y. C. Chen

Publication date 1990

Published in Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/pnas.87.24.9635

zbMATH Keywords

labeled planed treesLabeled rooted treesLagrange inversion formulaordered partitionsSchröder treesTrees

Mathematics Subject Classification ID

Partitions of sets (05A18) Trees (05C05)

Recommendations

• A general bijective algorithm for increasing trees
• A coding algorithm for Rényi trees
• Applications of antilexicographic order. I: An enumerative theory of trees
• A new bijection on rooted forests
• Bijections for a class of labeled plane trees

Cited in

(43)

• Potential polynomials and Motzkin paths
• Bijections between formulae and trees which are compatible with equivalences of the type ((f g) h) ((f h) g)
• A coding algorithm for Rényi trees
• The pessimistic search and the straightening involution for trees
• The theory of compositionals
• Linear trees and RNA secondary structure
• Schröder parenthesizations and chordates
• On trees and noncrossing partitions
• A bijective proof of the Shor recurrence
• Description trees and Tutte formulas.
• Weakly increasing trees on a multiset
• Decomposition and merging algorithms for noncrossing forests
• On the \(\gamma\)-positivity of multiset Eulerian polynomials
• Koszul duality for monoids and the operad of enriched rooted trees
• A note on divisors of multinomial coefficients
• An identity involving Narayana numbers
• Riordan paths and derangements
• RNA secondary structures with given motif specification: combinatorics and algorithms
• A semi-bijective algorithm for saturated extended 2-regular simple stacks
• A general bijective algorithm for increasing trees
• scientific article; zbMATH DE number 3887720 (Why is no real title available?)
• scientific article; zbMATH DE number 4091527 (Why is no real title available?)
• An antipode formula for the natural Hopf algebra of a set operad.
• A decomposition algorithm for noncrossing trees
• A recursive algorithm for trees and forests
• A note on trees, tables, and algorithms
• Hook length polynomials for plane forests of a certain type
• New equidistributions on plane trees and decompositions of 132-avoiding permutations
• More bijective combinatorics of weakly increasing trees
• Unified parallel encoding and decoding algorithms for Dandelion-like codes
• On Ward numbers and increasing Schröder trees
• A new bijection on rooted forests
• Context-free grammars, differential operators and formal power series
• Combinatorics on the joint distribution of hairpins and stacks in RNA secondary structures
• Bijections in weakly increasing trees via binary trees
• A symmetry on weakly increasing trees and multiset Schett polynomials
• New refinements of Narayana polynomials and Motzkin polynomials
• Applications of antilexicographic order. I: An enumerative theory of trees
• Parity reversing involutions on plane trees and 2-Motzkin paths
• Old and young leaves on plane trees
• On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials
• The Star of David rule
• Bijective linear time coding and decoding for \(k\)-trees

This page was built for publication: A general bijective algorithm for trees.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3487361)