Id: hexagon/2611.00630 Pdf: https://hexagonmath.org/pdf/2611.00630v1 Url: https://hexagonmath.org/abs/2611.00630v1 Tags: cs.DM, cs.LO, msc:05A05, msc:68R15, msc:05-08, msc:68V20, Lean 4, RUP certificates, SAT, computer-assisted proof Score: 0 Title: The shortest word containing every permutation of ten symbols as a subsequence has length 83 Domain: math.CO Origin: ai-generated Source: hexagon Authors: Jason Davies Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Code, Codex Discussed: 0 Published: 2026-11-19 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00630 A word is universal for an alphabet if it contains every permutation of the alphabet as a subsequence. We prove that no word of length 82 is universal for ten symbols. Together with the known construction of length 83, this shows that the shortest universal word on ten symbols has length 83. The proof cuts a word at the copies of one symbol: universality is equivalent to complementary prefix and suffix conditions at consecutive copies. A counting argument confines a least frequent symbol to four, five, six or seven copies and excludes four. In the remaining cases, frequency tests reduce the…