A general bijective algorithm for trees.

DOI10.1073/PNAS.87.24.9635zbMath0707.05019OpenAlexW2139452826WikidataQ33924041 ScholiaQ33924041MaRDI QIDQ3487361

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

Lagrange inversion formulaTreesordered partitionsLabeled rooted treesSchröder treeslabeled planed trees

Mathematics Subject Classification ID

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

Related Items (27)

Parity reversing involutions on plane trees and 2-Motzkin paths ⋮ Old and young leaves on plane trees ⋮ On the \(\gamma\)-positivity of multiset Eulerian polynomials ⋮ Linear trees and RNA secondary structure ⋮ Schröder parenthesizations and chordates ⋮ On trees and noncrossing partitions ⋮ An antipode formula for the natural Hopf algebra of a set operad. ⋮ A decomposition algorithm for noncrossing trees ⋮ An identity involving Narayana numbers ⋮ RNA secondary structures with given motif specification: combinatorics and algorithms ⋮ A semi-bijective algorithm for saturated extended 2-regular simple stacks ⋮ On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials ⋮ Hook length polynomials for plane forests of a certain type ⋮ Unified parallel encoding and decoding algorithms for Dandelion-like codes ⋮ The Star of David rule ⋮ A recursive algorithm for trees and forests ⋮ A bijective proof of the Shor recurrence ⋮ Context-free grammars, differential operators and formal power series ⋮ A coding algorithm for Rényi trees ⋮ Riordan paths and derangements ⋮ Bijective linear time coding and decoding for \(k\)-trees ⋮ Koszul duality for monoids and the operad of enriched rooted trees ⋮ Weakly increasing trees on a multiset ⋮ Decomposition and merging algorithms for noncrossing forests ⋮ Potential polynomials and Motzkin paths ⋮ The theory of compositionals ⋮ A note on divisors of multinomial coefficients

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