Mind Switches in Futurama and Stargate

Published 22 Sep 2012 in math.GR and math.CO | (1209.4991v3)

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.

Abstract PDF Upgrade to Chat

Authors (2)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

HackerNews

Mind Switches in Futurama and Stargate (2 points, 1 comment)