来源：Illinois Journal of Mathematics, 2010, 54(1): 109-128.
摘要
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.
科研之友
微信
新浪微博
Facebook
分享链接
