Pages that link to "Item:Q3487361"

The following pages link to A general bijective algorithm for trees. (Q3487361):

Displaying 38 items.

• An antipode formula for the natural Hopf algebra of a set operad. (Q395254) (← links)
• A decomposition algorithm for noncrossing trees (Q405065) (← links)
• A recursive algorithm for trees and forests (Q507491) (← links)
• Hook length polynomials for plane forests of a certain type (Q659804) (← links)
• Unified parallel encoding and decoding algorithms for Dandelion-like codes (Q666249) (← links)
• A new bijection on rooted forests (Q686461) (← links)
• Context-free grammars, differential operators and formal power series (Q688685) (← links)
• Applications of antilexicographic order. I: An enumerative theory of trees (Q757391) (← links)
• Parity reversing involutions on plane trees and 2-Motzkin paths (Q819014) (← links)
• Old and young leaves on plane trees (Q820084) (← links)
• On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials (Q903707) (← links)
• The Star of David rule (Q947659) (← links)
• Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
• Potential polynomials and Motzkin paths (Q1043605) (← links)
• Bijections between formulae and trees which are compatible with equivalences of the type ((f\(\circ g)\circ h)\sim ((f\circ h)\circ g)\) (Q1078190) (← links)
• A coding algorithm for Rényi trees (Q1207762) (← links)
• The pessimistic search and the straightening involution for trees (Q1266368) (← links)
• The theory of compositionals (Q1313850) (← links)
• Linear trees and RNA secondary structure (Q1329791) (← links)
• Schröder parenthesizations and chordates (Q1331129) (← links)
• On trees and noncrossing partitions (Q1383385) (← links)
• A bijective proof of the Shor recurrence (Q1746570) (← links)
• Description trees and Tutte formulas. (Q1853738) (← links)
• Weakly increasing trees on a multiset (Q2040987) (← links)
• Decomposition and merging algorithms for noncrossing forests (Q2062886) (← links)
• On the \(\gamma\)-positivity of multiset Eulerian polynomials (Q2122679) (← links)
• Koszul duality for monoids and the operad of enriched rooted trees (Q2267540) (← links)
• A note on divisors of multinomial coefficients (Q2350500) (← links)
• An identity involving Narayana numbers (Q2426447) (← links)
• Riordan paths and derangements (Q2483401) (← links)
• RNA secondary structures with given motif specification: combinatorics and algorithms (Q2687721) (← links)
• A semi-bijective algorithm for saturated extended 2-regular simple stacks (Q2689170) (← links)
• A general bijective algorithm for increasing trees (Q2721872) (← links)
• (Q3222216) (← links)
• (Q3819083) (← links)
• A note on trees, tables, and algorithms (Q5191139) (← links)
• New equidistributions on plane trees and decompositions of \(132\)-avoiding permutations (Q6614179) (← links)
• More bijective combinatorics of weakly increasing trees (Q6614413) (← links)