Minimal superpermutation length $L(8)$
The shortest length of a string that contains each permutation of $8$ symbols as a substring.
Lower bound:
Unknown
Upper bound:
$46205$
(46,205)
Updates
-
Upper bound: $46233$
(46,233)
Reference unknown
[via Superpermutations - Greg Egan] -
Upper bound: $46205$
(46,205)
Reference unknown
[via Superpermutations - Greg Egan]