Minimal superpermutation length $L(7)$
The shortest length of a string that contains each permutation of $7$ symbols as a substring.
Lower bound:
Unknown
Upper bound:
$5906$
Updates
-
Upper bound: $5913$
Reference unknown
[via Superpermutations - Greg Egan] -
Upper bound: $5908$
Reference unknown
[via Superpermutations - Greg Egan] -
2019-02-01
Upper bound: $5907$
Charlie Vane (Bogdan Coanda) on 2019-02-01
[via Superpermutations - Greg Egan] -
2019-02-27
Upper bound: $5906$
Robin Houston and Greg Egan on 2019-02-27
[via Superpermutations - Greg Egan]