Minimal superpermutation length $L(6)$
The shortest length of a string that contains each permutation of $6$ symbols as a substring.
Lower bound:
Unknown
Upper bound:
$872$
Updates
-
Upper bound: $873$
Reference unknown
[via Superpermutations - Greg Egan] -
2014-08-21
Upper bound: $872$
Houston, R. (2014). Tackling the minimal superpermutation problem. arXiv preprint arXiv:1408.5108.
[via Superpermutations - Greg Egan]