Stable commutator length in free products of cyclic groups

TL;DR

This paper introduces a polynomial-time algorithm for computing stable commutator length in free products of cyclic groups, with applications demonstrated through experiments and theory.

Contribution

It provides the first efficient algorithm for stable commutator length in this class of groups, expanding computational tools in geometric group theory.

Findings

Algorithm runs in polynomial time relative to input size

Successfully applied to various examples and theoretical problems

Enhances understanding of stable commutator length in free products

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.