Stable commutator length in free products of cyclic groups
Geometric Topology
2013-04-24 v1 Group Theory
Abstract
We give an algorithm to compute stable commutator length in free products of cyclic groups which is polynomial time in the length of the input, the number of factors, and the orders of the finite factors. We also describe some experimental and theoretical applications of this algorithm.
Keywords
Cite
@article{arxiv.1304.6312,
title = {Stable commutator length in free products of cyclic groups},
author = {Alden Walker},
journal= {arXiv preprint arXiv:1304.6312},
year = {2013}
}
Comments
23 pages, 17 figures