Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T13:59:11.607Z Has data issue: false hasContentIssue false

Words without Near-Repetitions

Published online by Cambridge University Press:  20 November 2018

J. Currie
Affiliation:
Department of Mathematics University of Winnipeg Winnipeg, Manitoba R3B 2E9
A. Bendor-Samuel
Affiliation:
Department of Mathematics University of Winnipeg Winnipeg, Manitoba R3B 2E9
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We find an infinite word w on four symbols with the following property: Two occurrences of any block in w must be separated by more than the length of the block. That is, in any subword of w of the form xyx, the length of y is greater than the length of x. This answers a question of C. Edmunds connected to the Burnside problem for groups.

Keywords

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1992