Unique subwords in nonperiodic words
HTML articles powered by AMS MathViewer
- by C. M. Weinbaum PDF
- Proc. Amer. Math. Soc. 109 (1990), 615-619 Request permission
Abstract:
Let $A,D$ be words over some alphabet. $D$ has position $p$ in the cyclic word $A$ if the cyclic permutation of $A$ which begins with the $p$th letter of $A$ has an initial subword equal to $D$. It is proved that every nonperiodic word $A$ of length $> 1$ has a cyclic permutation which is a product BC for some nonempty subwords $B,C$ having unique positions in the cyclic word $A$.References
-
W. Magnus, A. Karrass, and D. Solitar, Combinatorial group theory, Interscience, New York, 1966.
Additional Information
- © Copyright 1990 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 109 (1990), 615-619
- MSC: Primary 20M05; Secondary 05A05, 20F05
- DOI: https://doi.org/10.1090/S0002-9939-1990-1017852-0
- MathSciNet review: 1017852