{"id":"palomar/PALOMAR-2026-10-27-000002","url":"https://github.com/jaypantone/2026-10-superpermutation-upper-palomar/tree/b24e151fdf30ccdbae0e6fe5ab56fa325771722d","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-10-27-000002-v1.json","repo":"https://github.com/jaypantone/2026-10-superpermutation-upper-palomar","tags":["math.CO","msc:05A05","msc:68R15","msc:03B35"],"score":0,"title":"A smaller upper bound for superpermutations","trust":"high","domain":"math.CO","source":"palomar","authors":["Jay Pantone"],"reviews":0,"subject":"math.CO","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-10-27","reactions":{},"formalized":true,"formalizes":[{"title":"A smaller upper bound for superpermutations","identifier":"https://github.com/jaypantone/2026-10-superpermutation-bounds/tree/c9ccb6a0d9ddd1007fdce6efab50807ec47464b9/papers/upper/upper-bounds.tex","relationship":"formalizes"}]}