{"version":"1.0","type":"link","title":"Superpermutation - Newikis","description":"In combinatorial mathematics, a superpermutation on n symbols is a string that contains each permutation of n symbols as a substring. While trivial superpermutations can simply be made up of every permutation concatenated together, superpermutations can also be shorter (except for the trivial case…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://upload.wikimedia.org/wikipedia/commons/1/19/Superpermutation_distribution.png","thumbnail_width":561,"thumbnail_height":535}