Verbitsky, O.
(Algebra and Discrete Mathematics, 2003)
A theorem of Dekking in the combinatorics of
words implies that there exists an injective order-preserving transformation f : {0, 1, . . . , n} → {0, 1, . . . , 2n} with the restriction
f(i + 1) ≤ f(i) + 2 such that for ...