HackerPapers

arXiv:1209.4991math.GR

Mind Switches in Futurama and Stargate

Ron Evans, Lihua Huang

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

Let P be a permutation expressed as a product of nontrivial disjoint cycles. When writing P as a product of distinct transpositions none equal to a factor of P, what is the smallest number of transpositions that can be used? We answer this question and give applications to mind-switching problems that have arisen in connection with the popular sci-fi television series Futurama and Stargate SG-1.

arXiv comments
17 pages
Journal reference
Math. Magazine 87 (2014) 252--262
DOI
Subjects
math.GRGroup Theory math.COCombinatorics

On Hacker News

No comments linking this paper were found in the collected sources. Found in 3 HN submissions from Sep 2012 to Dec 2025. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.