Minimal superpermutation length $L(9)$
The shortest length of a string that contains each permutation of $9$ symbols as a substring.
Lower bound:
Unknown
Upper bound:
$408966$
(408,966)
Updates
-
Upper bound: $409113$
(409,113)
Reference unknown
[via Superpermutations - Greg Egan] -
Upper bound: $408966$
(408,966)
Reference unknown
[via Superpermutations - Greg Egan]