Shortest superpermutations
A superpermutation is a word that contains every ordering of n different symbols as a contiguous block. How short can such a word be?
Why it matters and what counts as progress
Why it matters: Adjacent permutation blocks can overlap. Shorter constructions find ways to reuse more positions, and lower bounds limit the amount of reuse possible in any word.
What counts as progress: Construct a shorter covering word or prove that every covering word has at least a stated length. Separate bounds for a specific alphabet size from bounds that hold as the alphabet grows.
How the problem developed
- 6 Oct 2026 · Earlier all-size bounds [1]
Superpermutators community Jakub Halfar announced a new upper coefficient and formal verification of Cole Fritsch’s general lower bound, alongside finite bounds.
- 27 Oct 2026 · New asymptotic bounds [2]
Jay Pantone with AI assistance Jay Pantone’s projects sharpen the upper coefficient and improve lower-order terms in the general lower bound. The projects credit AI with the new research and keep prior constructions and search tools separately attributed.
- 27 Oct 2026 · New lower bound [3]
Jay Pantone with AI assistance The results improve a general lower bound below its leading correction and give separate finite refinements.
AI contributions 2
Chain returns and lower bounds for superpermutations
Pantone reports two lower bounds on minimum superpermutation length for . Both add a leading correction of to . The exact-order formula improves the cited general bound in lower-order terms for all sufficiently large n.
A smaller upper bound for superpermutations
Let be the minimum length of a word containing all permutations of n symbols as contiguous blocks. Pantone’s construction proves .
Sources
Publication history
Daily emails by default, only when there’s an update.