About Duval’s Conjecture
- 299 Downloads
A word is called unbordered if it has no proper prefix which is also a suffix of that word. Let µ(w) denote the length of the longest unbordered factor of a word w. Let a word where the longest unbordered prefix equal to µ(w) be called Duval extension. A Duval extension is called trivial, if its longest unbordered factor is of the length of the period of that Duval extension. In 1982 it was shown by Duval that every Duval extension w longer than 3µ(w) − 4 is trivial. We improve that bound to 5µ(w)/2−1 in this paper, and with that, move closer to the bound 2µ(w) conjectured by Duval. Our proof also contains a natural application of the Critical Factorization Theorem.
Unable to display preview. Download preview PDF.
- 7.T. Harju and D. Nowotka. Duval’s conjecture and Lyndon words. submitted to Discrete Math., 2002.Google Scholar