| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903653 | European Journal of Combinatorics | 2018 | 7 Pages |
Abstract
We also consider a variant of this problem, due to Blanchet-Sadri and Lazarow, in which the word is allowed to contain 'holes', which are special symbols functioning as 'jokers', i.e. are considered to be equal to any character. In particular, we estimate the average longest common extension over all words w with a small number of holes, extending a result by Blanchet-Sadri, Harred and Lazarow, and prove a similar result for words with holes appearing randomly.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Béla Bollobás, Shoham Letzter,