Abstract
This note presents an example that disproves, forn=4, Weinbaum’s conjecture, that ifw is a cyclically reduced primitive word inF n such that all the generatorsx∈X appear inw then some cyclic permutation ofw can be partitioned inton words generatingF n :w≡uv,vu≡s 1 s 2…s n , =F n .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
