Abstract

Weinbaum [Proc. AMS, 109(3):615-619, 1990] showed that for each letter a in a primitive word w, there exists a conjugate w' = uv of w such that both u and v are uniquely positioned in the cyclic word w such that u begins and ends with a and v neither begins nor ends with a. We give a generalization of this result using iterative methods.

Keywords: combinatorics on words, Weinbaum factorizations

Full paper: [ps - 259 KB] [ps.gz - 118 KB] [pdf - 114 KB].