![]() The factorial rule predicts that to watch six episodes in every possible order should require 873 episodes, but Houston found a way to do it in 872. Then in 2014, Houston startled mathematicians by showing that for n = 6, the pattern breaks down. The factorial rule for superpermutations became conventional wisdom (even though no one could prove it was true for every value of n), and mathematicians later confirmed it for n = 5. For a two-episode series, the shortest superpermutation (121) has length 2! + 1!. If your series has just one episode, the shortest superpermutation has length 1! (also known as plain old 1). ![]() In 1993, Daniel Ashlock and Jenett Tillotson observed that if you look at the shortest superpermutations for different values of n, a pattern quickly seems to emerge involving factorials - those numbers, written in the form n!, that involve multiplying together all the numbers up to n (for example, 4! = 4 × 3 × 2 × 1). ![]() A sequence like this one that contains every possible rearrangement (or permutation) of a collection of n symbols is called a “superpermutation.” You could string these six sequences together to give a list of 18 episodes that includes every ordering, but there’s a much more efficient way to do it: 123121321. If a television series has just three episodes, there are six possible orders in which to view them: 123, 132, 213, 231, 312 and 321. “It’s a weird situation that this very elegant proof of something that wasn’t previously known was posted in such an unlikely place,” Houston said. In their paper, they list the first author as “Anonymous 4chan Poster.” Now, Houston and Pantone, joined by Vince Vatter of the University of Florida in Gainesville, have written up the formal argument. “It took a lot of work to try to figure out whether or not it was correct,” Pantone said, since the key ideas hadn’t been expressed particularly clearly. Then Robin Houston, a mathematician at the data visualization firm Kiln, and Jay Pantone of Marquette University in Milwaukee independently verified the work of the anonymous 4chan poster. Mathematicians quickly verified Egan’s upper bound, which, like the lower bound, applies to series of any length. Both proofs are now being hailed as significant advances on a puzzle mathematicians have been studying for at least 25 years. Egan’s discovery renewed interest in the problem and drew attention to the lower bound posted anonymously in 2011. But in a plot twist last month, the Australian science fiction novelist Greg Egan proved a new upper bound on the number of episodes required. The proof slipped under the radar of the mathematics community for seven years - apparently only one professional mathematician spotted it at the time, and he didn’t check it carefully. “Please look over for any loopholes I might have missed,” the anonymous poster wrote. The argument, which covered series with any number of episodes, showed that for the 14-episode first season of Haruhi, viewers would have to watch at least 93,884,313,611 episodes to see all possible orderings. In less than an hour, an anonymous person offered an answer - not a complete solution, but a lower bound on the number of episodes required. Fans were arguing online about the best order to watch the episodes, and the 4chan poster wondered: If viewers wanted to see the series in every possible order, what is the shortest list of episodes they’d have to watch? Season one of the show, which involves time travel, had originally aired in nonchronological order, and a re-broadcast and a DVD version had each further rearranged the episodes. On September 16, 2011, an anime fan posted a math question to the online bulletin board 4chan about the cult classic television series The Melancholy of Haruhi Suzumiya.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |