Minimal superpermutation length $L(1)$

The shortest length of a string that contains each permutation of $1$ symbols as a substring.

Updates

• Lower bound: $1$
  Trivial or easy according to the secondary source.
  [via Superpermutations - Greg Egan]
• Upper bound: $1$
  Trivial or easy according to the secondary source.
  [via Superpermutations - Greg Egan]