2000 character limit reached
Scl in graphs of groups
Published 17 Apr 2019 in math.GT and math.GR | (1904.08360v2)
Abstract: Let G be a group acting on a tree with cyclic edge and vertex stabilizers. Then stable commutator length (scl) is rational in G. Furthermore, scl varies predictably and converges to rational limits in so-called "surgery" families. This is a homological analog of the phenomenon of geometric convergence in hyperbolic Dehn surgery.
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.