2000 character limit reached
Stable commutator length in free products of cyclic groups
Published 23 Apr 2013 in math.GT and math.GR | (1304.6312v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.