A linear-time algorithm to compute geodesics in solvable Baumslag-Solitar groups

preprint2010arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

A linear-time algorithm to compute geodesics in solvable Baumslag-Solitar groups

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0