Geometry and topology · Oct 6, 2026

The sharp exponential scale of edit-distance distortion

Determines the least distortion of embedding edit distance on words of length at most d into real ℓ1: it is exp⁡(Θ(log⁡d log⁡log⁡d))\exp(\Theta(\sqrt{\log d\,\log\log d})). Insertions, deletions and substitutions have unit cost. The constants are uniform over all finite alphabets with at least two symbols, even when the alphabet grows with d; binary words already force the lower bound.

Contributors

Unreleased OpenAI model

AI systems: Unreleased OpenAI model

Sources