A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A Note on the Factorization of Permutations into Cycles
2017
International Electronic Journal of Algebra
Preserved Fulltext
We find conditions on k, n ∈ N, where 3 ≤ k ≤ n for which a permutation in Sn can be written as a product of distinct k-cycles in S n+i \Sn, for some i ∈ N. This result generalizes a problem that was solved in 2010 in an episode of the television show Futurama: the so-called Futurama Theorem.
doi:10.24330/ieja.325937
fatcat:hugstdtgebganfslo7232fllbm