= Superpermutation
{wiki=Superpermutation}
A superpermutation is a specific kind of permutation that contains every permutation of a set of \\( n \\) elements as a contiguous subsequence. More formally, if you have \\( n \\) distinct symbols, a superpermutation is a string that includes each possible ordering of those symbols—called permutations—at least once. The length of the shortest superpermutation for \\( n \\) elements has been the subject of interest in combinatorial mathematics.
Back to article page
