Unique subwords in nonperiodic words
Author: C. M. Weinbaum
Journal: Proc. Amer. Math. Soc. 109 (1990), 615-619
MSC: Primary 20M05; Secondary 05A05, 20F05
MathSciNet review: 1017852
Full-text PDF Free Access
Abstract: Let be words over some alphabet. has position in the cyclic word if the cyclic permutation of which begins with the th letter of has an initial subword equal to . It is proved that every nonperiodic word of length has a cyclic permutation which is a product BC for some nonempty subwords having unique positions in the cyclic word .
-  W. Magnus, A. Karrass, and D. Solitar, Combinatorial group theory, Interscience, New York, 1966.
- W. Magnus, A. Karrass, and D. Solitar, Combinatorial group theory, Interscience, New York, 1966.
Keywords: Generators and relations, presentations, cancellation theory, word problems, free semigroups, partitions
Article copyright: © Copyright 1990 American Mathematical Society