Output details
11 - Computer Science and Informatics
University of Strathclyde
Article title
Crucial abelian k-power-free words
Type
D - Journal article
DOI
-
Title of journal
Discrete Mathematics and Theoretical Computer Science
Article number
-
Volume number
12
Issue number
5
First page of article
83
ISSN of journal
1365-8050
Year of publication
2010
Number of additional authors
2
Additional information
<12>Solves a challenging problem that was open for several years, in a popular topic initiated by Erdös in combinatorics on words. Uses novel techniques for generalising a known construction of crucial words for abelian squares to abelian cubes and higher dimensions. A conjectured solution for a general problem is provided that was shown to be asymptotically correct in a follow-up paper. Will have a major influence on the subject of bicrucial words, since it provides a new basic way of tackling problems in this area. Is agenda-setting because it introduces Ramsey-type problems (traditionally studied on graphs) for abelian k-power-free words.
Interdisciplinary
-
Cross-referral requested
10 - Mathematical Sciences
Research group
A - Theoretical Computer Science
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
