in combinatorial math, a superpermutation is a list of numbers that contains each different arrangement of symbols it is made up of inside of it. while superpermutations can simply be made up of every arrangement listed side by side, it can also be shorter. sometimes, the arrangements may overlap. for example, when there are 2 different symbols, the superpermutation 1221 contains all possible arrangements, 12 and 21. the list 121 also contains both permutations, 12 at the beginning and 21 at the end.