On the rotation distance between binary trees

Patrick Dehornoy (1)

1 LMNO - Laboratoire de Mathématiques Nicolas Oresme

We develop combinatorial methods for computing the rotation distance between binary trees, i.e., equivalently, the flip distance between triangulations of a polygon. As an application, we prove that, for each n, there exist size n trees at distance 2n - O(sqrt(n)).

Mots clés: binary tree; rotation distance: triangulations; flip; Thompson's group

Domaines: Combinatoire [math.CO]

Patrick Dehornoy. On the rotation distance between binary trees. 2009. ⟨hal-00353917⟩