Short notes: Some Properties of the Rotation Lattice of Binary Trees

DOI10.1093/COMJNL/31.6.564MaRDI QIDQ3800101zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/31.6.564

zbMATH Keywords

binary unordered treesBoolean sublatticerotation lattice of binary ordered trees

Mathematics Subject Classification ID

Trees (05C05) Modular lattices, complemented lattices (06C99)

Recommendations

• The rotation -lattice of ternary trees
• Rotational tree structures on binary trees and triangulations
• scientific article; zbMATH DE number 4055654
• On Rotations and the Generation of Binary Trees
• scientific article; zbMATH DE number 892276

Cited in

(23)

• Generating binary trees by Glivenko classes on Tamari lattices
• A Motzkin filter in the Tamari lattice
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• The pruning-grafting lattice of binary trees
• A direct algorithm for restricted rotation distance
• Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees
• Tamari lattices and noncrossing partitions in type \(B\)
• The number of coverings in four catalan lattices
• On 0-rotatable trees
• An algorithm to compute the möbius function of the rotation lattice of binary trees
• scientific article; zbMATH DE number 2134123 (Why is no real title available?)
• Effective splaying with restricted rotations
• Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions
• Shellable nonpure complexes and posets. II
• The higher Stasheff‐Tamari posets
• Lattices of labelled ordered trees. II
• An efficient algorithm for estimating rotation distance between two binary trees
• Binary trees equipped with semivaluations
• The rotation -lattice of ternary trees
• An improved kernel size for rotation distance in binary trees
• On the rotation distance between binary trees
• Combinatorial Gray codes for classes of pattern avoiding permutations
• Weak associativity and restricted rotation

This page was built for publication: Short notes: Some Properties of the Rotation Lattice of Binary Trees

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