Constructs infinite 3⁺-parameterized-square-free ternary words and 3⁺-order-preserving-square-free binary words via morphic substitutions, plus reports longest finite ℓ⁺-square-free words under several equivalences.
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem , Volume =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Relaxation of Square-Freeness
Constructs infinite 3⁺-parameterized-square-free ternary words and 3⁺-order-preserving-square-free binary words via morphic substitutions, plus reports longest finite ℓ⁺-square-free words under several equivalences.