2013/04/23 by Alden Walker, Walker, Alden
Computer Science · Mathematics · #20E06 #20F05 #20F65 #57M07 #FOS: Mathematics #Finite Group Theory Research #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Group Theory (math.GR) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1304.6312
openalex publication_date 2013/04/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.