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 language | English |
|---|---|
| Pages (from-to) | 186-188 |
| Number of pages | 3 |
| Journal | Israel Journal of Mathematics |
| Volume | 39 |
| Issue number | 3 |
| DOIs | |
| State | Published - Sep 1981 |