The mathematical puzzle of the shortest possible superpermutation
How can you arrange a set of symbols so that every possible permutation appears exactly once? This video with Dr. James Grime explores the complex challenge of finding the shortest superpermutation.
The video features mathematician Dr. James Grime discussing the intricacies of superpermutations. The core of the problem lies in finding the most efficient sequence that contains all possible permutations of a given set of symbols. While the exact length for larger sets remains a subject of intense mathematical scrutiny, the search for these minimal strings reveals the deep complexity hidden within simple combinatorial structures.
Source: Superpermutations - Numberphile
