A proof of the extended Duval's conjecture (Q557916): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015040013 / rank | |||
Normal rank | |||
Revision as of 19:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof of the extended Duval's conjecture |
scientific article |
Statements
A proof of the extended Duval's conjecture (English)
0 references
30 June 2005
0 references
A word \(u\) is said to be bordered iff there exists a nonempty word \(r\), \(r\neq u\), which is both prefix and suffix of \(u\). There is given a short and elementary proof of the following stronger version of Duval's conjecture. Let \(u\) be an unbordered word, and \(v\) a word of length \(|u|-1\), such that \(v\) is not a prefix of \(u\). Then \(uv\) contains an unbordered word of length at least \(|u|+1\).
0 references
Combinatorics on words
0 references
Duval's conjecture
0 references
unbordered words
0 references
