Weak associativity and restricted rotation

DOI10.1016/j.ipl.2009.01.014zbMath1209.68351OpenAlexW1980291790MaRDI QIDQ987810

Jean-Marcel Pallo

Publication date: 16 August 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.014

zbMATH Keywords

rotationcombinatorial problemsbinary treesweak associativity

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (3)

Quasi-symmetric functions and the KP hierarchy ⋮ Root-restricted Kleenean rotations ⋮ Unnamed Item

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-restricted rotation distance between binary trees
• From nonassociativity to solutions of the KP hierarchy
• Generating binary trees by Glivenko classes on Tamari lattices
• Right-arm rotation distance between binary trees
• Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
• Quasigroups, loops, and associative laws
• Restricted rotation distance between binary trees.
• Effective splaying with restricted rotations
• A new approach to deformation equations of noncommutative KP hierarchies
• Enumerating, Ranking and Unranking Binary Trees
• A decidable word problem without equivalent canonical term rewriting system
• BOUNDING RIGHT-ARM ROTATION DISTANCES
• Algorithms and Data Structures
• An algebraic scheme associated with the non-commutative KP hierarchy and some of its extensions

This page was built for publication: Weak associativity and restricted rotation