A general bijective algorithm for trees.

DOI10.1073/PNAS.87.24.9635zbMATH Open0707.05019OpenAlexW2139452826WikidataQ33924041 ScholiaQ33924041MaRDI QIDQ3487361FDOQ3487361

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

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

zbMATH Keywords

Lagrange inversion formulaordered partitionsTreesLabeled rooted treesSchröder treeslabeled planed trees

Mathematics Subject Classification ID

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

Cited In (38)

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