Abstract
We present an algorithm to convert a word of length $n$ in the standard generators of the solvable Baumslag–Solitar group $\operatorname{BS}(1,p)$ into a geodesic word, which runs in linear time and $O(n\log n)$ space on a random access machine.
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 callDisclaimer: 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.
