4 citations · 10 across the 15 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2009
On the distance between the expressions of a permutation
Marc Autord, Patrick Dehornoy
We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n^4), a sharp bound. Using a…
math.CO2009★ 3 cited
On the rotation distance between binary trees
Patrick Dehornoy
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 applicat…
math.CO2005
Combinatorics of normal sequences of braids
Patrick Dehornoy
Many natural counting problems arise in connection with the normal form of braids--and seem to have never been considered so far. Here we solve some of them by analysing the normal…