Chain returns and lower bounds for superpermutations

Get email updates

Jay Pantone

Pantone reports two lower bounds on minimum superpermutation length for n≥8n \ge 8. Both add a leading correction of (2+o(1))(n−4)!(2+o(1))(n-4)! to n!+(n−1)!+(n−2)!n! + (n-1)! + (n-2)!. The exact-order formula improves the cited general bound in lower-order terms for all sufficiently large n.

What was already known

The all-size comparison is with the formula by Cole Fritsch, formalized by Jakub Halfar. The leading correction agrees with that formula, and the gains depend on n modulo three.

AI involvement AI-led

The project credits AI systems with its new mathematical work under Pantone’s direction. The ten-symbol certificate builds on Halfar’s framework. The fourteen-symbol bound uses a separate compatibility argument.

Importance Modest

The results improve a general lower bound below its leading correction and give separate finite refinements.

Technical verification Formal (Lean)

The pinned development supplies Lean proofs for the two general formulas, their asymptotic comparisons and separate ten- and fourteen-symbol lower bounds. It distinguishes the earlier native-qualified thirteen-symbol result.

Formal checking

The pinned development supplies Lean proofs for the two general formulas, their asymptotic comparisons and separate ten- and fourteen-symbol lower bounds. It distinguishes the earlier native-qualified thirteen-symbol result.

Checker
Jay Pantone, reporting Lean 4 verification
Scope
The pinned development supplies Lean proofs for the two general formulas, their asymptotic comparisons and separate ten- and fourteen-symbol lower bounds. It distinguishes the earlier native-qualified thirteen-symbol result.
Basis
Reported by the linked checker

Human understanding Few

The project attributes the proof and exposition to AI. A human explanation of the new return-order argument is undocumented.

Correction and publication history