Logspace computations for Garside groups of spindle type
Group Theory
2013-10-29 v3 Computational Complexity
Symbolic Computation
Abstract
M. Picantin introduced the notion of Garside groups of spindle type, generalizing the 3-strand braid group. We show that, for linear Garside groups of spindle type, a normal form and a solution to the conjugacy problem are logspace computable. For linear Garside groups of spindle type with homogenous presentation we compute a geodesic normal form in logspace.
Keywords
Cite
@article{arxiv.1310.0933,
title = {Logspace computations for Garside groups of spindle type},
author = {Murray Elder and Arkadius Kalka},
journal= {arXiv preprint arXiv:1310.0933},
year = {2013}
}
Comments
22 pages; short version as v1. Terminolgy and title changed. In particular, in previous versions we called Garside groups of spindle type "rigid Garside groups"