On the centralizer of generic braids
Group Theory
2018-02-15 v1 Geometric Topology
Abstract
We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure. We present an algorithm to compute the centralizer of a braid whose generic-case complexity is quadratic on the length of the input, and which outputs a minimal set of generators in the generic case.
Keywords
Cite
@article{arxiv.1802.04897,
title = {On the centralizer of generic braids},
author = {Juan Gonzalez-Meneses and Dolores Valladares},
journal= {arXiv preprint arXiv:1802.04897},
year = {2018}
}
Comments
19 pages, 3 figures