Stable commutator length in free products of cyclic groups
Walker, Alden
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.