BOUNDING RIGHT-ARM ROTATION DISTANCES

DOI10.1142/S0218196707003664zbMath1179.68105arXivmath/0506413OpenAlexW2136396948MaRDI QIDQ5297790

Sean Cleary, Jennifer Taback

Publication date: 13 July 2007

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0506413

zbMATH Keywords

binary treeThompson's group \(F\)rotation distance

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Geometric group theory (20F65) Distance in graphs (05C12) Data structures (68P05)

Related Items (5)

Restricted rotation distance between k-ary trees ⋮ Refined upper bounds for right-arm rotation distances ⋮ Root-restricted Kleenean rotations ⋮ Weak associativity and restricted rotation ⋮ Rotation distance is fixed-parameter tractable

Cites Work

• Unnamed Item
• An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group
• Right-arm rotation distance between binary trees
• Bounding restricted rotation distance
• A note on some tree similarity measures
• Minimal length elements of Thompson's group \(F\)
• Thompson's group \(F\) is not almost convex.
• An efficient upper bound of the rotation distance of binary trees
• Restricted rotation distance between binary trees.
• Combinatorial properties of Thompson’s group 𝐹

This page was built for publication: BOUNDING RIGHT-ARM ROTATION DISTANCES