Stable commutator length in free products of cyclic groups
classification
🧮 math.GT
math.GR
keywords
lengthalgorithmcommutatorcyclicfactorsfreegroupsproducts
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.