A general bijective algorithm for trees.
From MaRDI portal
Recommendations
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
- A coding algorithm for Rényi trees
- scientific article; zbMATH DE number 3887720 (Why is no real title available?)
- 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.
- On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials
- New equidistributions on plane trees and decompositions of \(132\)-avoiding permutations
- More bijective combinatorics of weakly increasing trees
- 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.
- Riordan paths and derangements
- A semi-bijective algorithm for saturated extended 2-regular simple stacks
- scientific article; zbMATH DE number 4091527 (Why is no real title available?)
- 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 g) h) ((f h) g)
- Unified parallel encoding and decoding algorithms for Dandelion-like codes
- The Star of David rule
- Old and young leaves on plane trees
- RNA secondary structures with given motif specification: combinatorics and algorithms
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)
