[Paper Review] Keeler's theorem and products of distinct transpositions

Ron Evans, Lihua Huang+1 more|arXiv (Cornell University)|Apr 26, 2012

Genome Rearrangement Algorithms5 references4 citations

TL;DR

This paper refines Keeler's theorem on mind-switching permutations in Futurama by presenting a more efficient algorithm that undoes any permutation using only $ n + r + 2 $ distinct transpositions—where $ n $ is the number of bodies and $ r $ the number of disjoint cycles—instead of Keeler’s original $ n + 2r $ or $ n + 2r + 1 $ switches. The method uses two outsiders to minimize switches while ensuring all transpositions are distinct and disjoint from the original ones.

ABSTRACT

An episode of Futurama features a two-body mind-switching machine which will not work more than once on the same pair of bodies. After the Futurama community engages in a mind-switching spree, the question is asked, "Can the switching be undone so as to restore all minds to their original bodies?" Ken Keeler found an algorithm that undoes any mind-scrambling permutation with the aid of two "outsiders." We refine Keeler's result by providing a more efficient algorithm that uses the smallest possible number of switches. We also present best possible algorithms for undoing two natural sequences of switches, each sequence effecting a cyclic mind-scrambling permutation in the symmetric group S_n. Finally, we give necessary and sufficient conditions on m and n for the identity permutation to be expressible as a product of m distinct transpositions in S_n.

Motivation & Objective

• To provide a more efficient algorithm than Keeler’s for undoing any mind-scrambling permutation using the minimal number of distinct transpositions.
• To determine the minimal number of switches required to restore minds to original bodies when using two outsiders.
• To establish necessary and sufficient conditions for the identity permutation to be expressed as a product of $ m $ distinct transpositions in $ S_n $.
• To analyze two canonical sequences of transpositions that generate $ n $-cycles and determine optimal undoing strategies for each.
• To prove that $ m $ must be even and at least 6 for the identity to be expressible as a product of $ m $ distinct transpositions in $ S_n $.

Proposed method

• Constructs a product $ \sigma \in S_{n+2} $ using transpositions involving two outsiders $ x $ and $ y $, ensuring all factors are distinct from the original transpositions in $ P $.
• For each cycle $ C_i $ of length $ k_i $, defines a product $ \sigma_i $ of $ k_i + 2 $ transpositions such that $ \sigma_i C_i = (xy) $, using only $ (xu) $ and $ (yu) $ factors.
• Combines $ \sigma_i $'s into $ \tau = \sigma_r \cdots \sigma_1 $, so that $ \tau P = (xy)^r $, and adjusts $ \sigma $ based on the parity of $ r $ to yield the identity.
• Proves optimality by showing $ n + r + 2 $ is the minimal number of transpositions required, using cycle decomposition and transposition counting arguments.
• Uses the function $ f(a,b,c) = (ac)(ab)(bc) $ to increase the number of transpositions in a product by 2 without changing the permutation, enabling inductive construction of identity products.
• Constructs explicit identity expressions in $ S_4 $ through $ S_8 $, then extends inductively to all $ S_n $ using the replacement technique with $ f(a,b,c) $.

Experimental results

Research questions

• RQ1 What is the minimal number of distinct transpositions required to undo any permutation $ P \in S_n $ using two outsiders?
• RQ2 Can the identity permutation be expressed as a product of $ m $ distinct transpositions in $ S_n $, and if so, for which values of $ m $?
• RQ3 What is the minimal number of switches needed to reverse the two canonical $ n $-cycle permutations $ P_1 $ and $ P_2 $ in $ S_n $?
• RQ4 Is Keeler’s original algorithm optimal, and if not, by how much can it be improved in terms of the number of transpositions?
• RQ5 What is the smallest number of outsiders required to undo a cyclic mind-scrambling permutation in $ S_n $, and how does this depend on $ n $?

Key findings

• The minimal number of transpositions required to undo any permutation $ P \in S_n $ with $ r $ disjoint cycles is $ n + r + 2 $, and this bound is tight.
• Keeler’s original algorithm is optimal only for $ r = 1 $ and $ r = 2 $; for $ r \geq 3 $, the new algorithm reduces the number of switches by at least 2.
• The identity permutation $ I $ can be expressed as a product of $ m $ distinct transpositions in $ S_n $ if and only if $ m $ is even and $ 6 \leq m \leq \binom{n}{2} $.
• For $ n \geq 4 $, there exist explicit constructions of $ I $ as a product of $ m $ distinct transpositions for all even $ m $ in the valid range, using inductive replacement via $ f(a,b,c) $.
• In $ S_4 $, the identity is expressible as a product of all six transpositions: $ (12)(23)(14)(13)(24)(34) $, and this is used as a base case for induction.
• For $ n = 2 $, two outsiders are required; for $ n = 3 $ and $ n = 4 $, one outsider suffices to undo $ P_1 $, with optimal $ \sigma $'s explicitly constructed.