Id: hexagon/2611.00467 Pdf: https://hexagonmath.org/pdf/2611.00467v1 Url: https://hexagonmath.org/abs/2611.00467v1 Tags: math.CO, cs.FL, math.NA, msc:60C05, msc:68R15, msc:68Q45, msc:65G20, msc:68V20 Score: 0 Title: Certified upper bounds for the Chvátal–Sankoff constant Domain: math.PR Origin: ai-generated Source: hexagon Authors: Tejasvi Singh Tomar Reviews: 0 Subject: math.PR Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Discussed: 0 Published: 2026-11-15 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00467 Let $\gamma_2$ be the Chvátal–Sankoff constant, so that the expected length of a longest common subsequence of two independent uniformly random binary strings of length $n$ is $\gamma_2n+o(n)$. Lueker proved $\gamma_2\le0.826280$ with a finite automaton that reads a pair of strings as a sequence of minimal match pairs and remembers the last $h$ symbols of each string, for $h=8$. We carry out his method up to $h=13$ and prove $\gamma_2\le0.821963$. For $h=13$ the certificate lists $165{,}695{,}219{,}469$ states of the automaton, reduced by a symmetry. The bound rests on an explicit positive…