Open Research Index

A smaller upper bound for superpermutations

Jay Pantone

Palomar Registrypalomar/PALOMAR-2026-10-27-000002Oct 27, 2026math.COscore 0

For the shortest superpermutation length S(n), construct covering words with asymptotic bound S(n) = 14 and its numerical consequences. The coefficient is approximately 0.510738. The argument combines a finite selection, a verified connector cover, and transport to larger alphabets.

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-10-27-000002
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-27-000002/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-27-000002/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'