A linear-time algorithm to compute geodesics in solvable Baumslag-Solitar groups
classification
🧮 math.GR
keywords
algorithmbaumslag-solitarsolvablewordaccesscomputeconvertgenerators
read the original abstract
We present an algorithm to convert a word of length $n$ in the standard generators of the solvable Baumslag-Solitar group $BS(1,p)$ into a geodesic word, which runs in linear time and $O(n\log n)$ space on a random access machine.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.