Lower bounding edit distances between permutations

A number of fields, including the study of genome rearrangements and the design of interconnection networks, deal with the connected problems of sorting permutations in “as few moves as possible”, using a given set of allowed operations, or computing the number of moves the sorting process requires, often referred to as the \emph{distance} of the permutation. These operations often act on just one or two segments of the permutation, e.g. by reversing one segment or exchanging two segments. The \emph{cycle graph} of the permutation to sort is a fundamental tool in the theory of genome rearrangements, and has proved useful in settling the complexity of many variants of the above problems. In this paper, we present an algebraic reinterpretation of the cycle graph of a permutation $\pi$ as an even permutation $\bar{\pi}$, and show how to reformulate our sorting problems in terms of particular factorisations of the latter permutation. Using our framework, we recover known results in a simple and unified way, and obtain a new lower bound on the \emph{prefix transposition distance} (where a \emph{prefix transposition} displaces the initial segment of a permutation), which is shown to outperform previous results. Moreover, we use our approach to improve the best known lower bound on the \emph{prefix transposition diameter} from $2n/3$ to $\lfloor3n/4\rfloor$, and investigate a few relations between some statistics on $\pi$ and $\bar{\pi}$.

💡 Research Summary

The paper tackles the fundamental problem of measuring how many elementary operations are needed to sort a permutation, a question that appears in genome rearrangement studies, interconnection network design, and various combinatorial optimization contexts. The authors focus on operations that affect only one or two contiguous segments of a permutation—most notably reversals, transpositions, and prefix transpositions (where the moved segment must begin at the first position).

A central contribution is the reinterpretation of the classic “cycle graph” of a permutation (\pi) as an even permutation (\bar{\pi}). By fixing two canonical even permutations (\alpha) and (\beta) (which encode the black–white bipartite structure of the cycle graph) and defining (\bar{\pi}= \alpha\pi\beta), the authors obtain a bijective mapping between the graphical representation and a purely algebraic object. This mapping preserves all the combinatorial information relevant for sorting: the number of cycles of (\bar{\pi}) equals the number of alternating black‑white cycles in the original graph, and other structural features (fixed points, 2‑cycles, etc.) correspond to well‑understood permutation statistics.

With (\bar{\pi}) in hand, each allowed operation can be described as a specific modification of (\bar{\pi})’s cycle structure. For example, a reversal inserts or deletes a pair of 2‑cycles, a transposition swaps two disjoint intervals and therefore merges or splits cycles in a predictable way, and a prefix transposition only touches the initial segment of (\bar{\pi}). By quantifying how many cycles can be eliminated (or created) by a single operation, the authors derive a generic lower‑bound principle: if one operation can reduce the cycle count by at most (\Delta), then any sorting sequence must contain at least (\lceil (c(\bar{\pi})-c_{\text{target}})/\Delta\rceil) steps, where (c(\cdot)) denotes the number of cycles and (c_{\text{target}}) is the cycle count of the identity permutation (which is (n)).

Applying this principle to prefix transpositions yields a new, tighter lower bound on the prefix‑transposition distance: \