Superpermutation
id:
superpermutation-163-3454088
title:
Superpermutation
text:
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 because overlap is allowed. For instance, in the case of n = 2, the superpermutation 1221 contains all possible permutations, but the shorter string 121 also contains both permutations. It has been shown that for 1 ≤ n ≤ 5, the sm
brand slug:
wiki
category slug:
encyclopedia
description:
String in combinatorial math
original url:
https://en.wikipedia.org/wiki/Superpermutation
date created:
2014-03-17T04:41:40Z
date modified:
2024-08-28T05:30:04Z
main entity:
{"identifier":"Q17048413","url":"https://www.wikidata.org/entity/Q17048413"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/1/19/Superpermutation_distribution.png","width":561,"height":535}
fields total:
13
integrity:
16