|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, Number 1, Pages 21–33
(Mi ivm6550)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Weinbaum factorizations of primitive words
V. Diekerta, T. Harjub, D. Nowotkaa a Institute of Formal Methods in Computer Science, University of Stuttgart, Stuttgart, Germany
b Department of Mathematics, University of Turku, Turku, Finland
Abstract:
Weinbaum [1] showed the following. Let $w$ be a primitive word and $a$ be letter in $w$. Then a conjugate of $w$ can be written as $uv$ such that $a$ is a prefix and $a$ suffix of $u$, but $v$ neither starts nor ends with $a$, and $u$ and $v$ have a unique position in $w$ as cyclic factors. The latter condition means that there is exactly one conjugate of $w$ having $u$ as a prefix and there is exactly one conjugate of $w$ having $v$ as a prefix. It is this condition which makes the result non-trivial.
We give a simplified proof for Weinbaum's result. Guided by this proof we exhibit quite different, but still simple, proofs for more general statements. For this purpose we introduce the notion of Weinbaum factor and Weinbaum factorization.
Keywords:
primitive word, conjugate words, cyclic factor.
Received: 16.01.2007
Citation:
V. Diekert, T. Harju, D. Nowotka, “Weinbaum factorizations of primitive words”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 1, 21–33; Russian Math. (Iz. VUZ), 54:1 (2010), 16–25
Linking options:
https://www.mathnet.ru/eng/ivm6550 https://www.mathnet.ru/eng/ivm/y2010/i1/p21
|
Statistics & downloads: |
Abstract page: | 291 | Full-text PDF : | 68 | References: | 34 | First page: | 1 |
|