Note on primitive words

E. Rips*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

This note presents an example that disproves, for n=4, Weinbaum's conjecture, that if w is a cyclically reduced primitive word in F n such that all the generators x∈X appear in w then some cyclic permutation of w can be partitioned into n words generating F n :w≡uv, vu≡s 1 s 2...s n, <s 1, s 2,...s n >=F n .

Original languageEnglish
Pages (from-to)186-188
Number of pages3
JournalIsrael Journal of Mathematics
Volume39
Issue number3
DOIs
StatePublished - Sep 1981

Fingerprint

Dive into the research topics of 'Note on primitive words'. Together they form a unique fingerprint.

Cite this