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
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.
- Chain returns and lower bounds for superpermutationsChain returns and lower bounds for superpermutations
Importance
The results improve a general lower bound below its leading correction and give separate finite refinements.
Technical verification
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
- Pinned theorem, provenance and checking recordPinned theorem, provenance and checking record
Human understanding
The project attributes the proof and exposition to AI. A human explanation of the new return-order argument is undocumented.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision