Mind switches in Futurama and Stargate

DOI10.4169/MATH.MAG.87.4.252zbMATH Open1325.05009arXiv1209.4991OpenAlexW2963278908MaRDI QIDQ3454166FDOQ3454166

Li-Hua Huang, Ron Evans

Publication date: 23 November 2015

Published in: Mathematics Magazine (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1209.4991

Recommendations

• A note on the factorization of permutations into cycles
• Keeler’s Theorem and Products of Distinct Transpositions
• Transposition graphs: an intuitive approach to the parity theorem for permutations
• Minimal factorizations of permutations into star transpositions
• Permutations as Products of Transpositions

zbMATH Keywords

permutationsmind switching

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Recreational mathematics (00A08)

Cited In (1)

• A duality for labeled graphs and factorizations with applications to graph embeddings and Hurwitz enumeration

This page was built for publication: Mind switches in Futurama and Stargate

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454166)