A proof of the extended Duval's conjecture (Q557916): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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\). | |||
| Property / review text: 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\). / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05A05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 2184111 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Combinatorics on words | |||
| Property / zbMATH Keywords: Combinatorics on words / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Duval's conjecture | |||
| Property / zbMATH Keywords: Duval's conjecture / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
unbordered words | |||
| Property / zbMATH Keywords: unbordered words / rank | |||
Normal rank | |||
Revision as of 14:10, 1 July 2023
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
