Generating binary trees by Glivenko classes on Tamari lattices

DOI10.1016/S0020-0190(02)00417-9zbMATH Open1181.68318OpenAlexW2088934887MaRDI QIDQ1007536FDOQ1007536

J. Martínez

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00417-9

zbMATH Keywords

algorithmslatticesbinary treesGlivenko classesrotation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Shellable nonpure complexes and posets. II
• Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
• On generating \(k\)-ary trees in computer representation
• Loopless generation of Gray codes for \(k\)-ary trees
• On the loopless generation of binary tree sequences
• Enumerating, Ranking and Unranking Binary Trees
• On Rotations and the Generation of Binary Trees
• A Survey of Combinatorial Gray Codes
• A Loopless Gray-Code Algorithm for Listing k-ary Trees
• An efficient upper bound of the rotation distance of binary trees
• Primes, irreducibles and extremal lattices
• Two families of Newman lattices
• Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
• Möbius functions of lattices
• Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
• A generalization of Rota's NBC theorem
• Monoïdes préordonnés et chaînes de Malcev
• Finite pseudocomplemented lattices and ``permutoedre
• Short notes: Some Properties of the Rotation Lattice of Binary Trees
• Pseudocomplemented semilattices, Boolean algebras, and compatible products
• An algorithm to compute the möbius function of the rotation lattice of binary trees

Cited In (6)

• Nonassociativity à la Kleene
• Weak associativity and restricted rotation
• The phagocyte lattice of Dyck words
• The pruning-grafting lattice of binary trees
• An efficient algorithm for estimating rotation distance between two binary trees
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Generating binary trees by transpositions 👍 👎
• Generating strictly binary trees at random based on convex polygon triangulations 👍 👎
• The generation of binary trees as a numerical problem 👍 👎
• On the generation of binary trees inA-order 👍 👎
• Generating binary trees of bounded height 👍 👎
• On the generation of binary trees from (0–1) codes 👍 👎
• A note on the generation of binary trees 👍 👎

This page was built for publication: Generating binary trees by Glivenko classes on Tamari lattices

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