paper

The full spectrum of scl on recursively presented groups

arXiv:1909.01309

Abstract

We show that the set of stable commutator lengths on recursively presented groups equals the set of non-negative right-computable numbers. Hence all non-negative algebraic or computable numbers are in and is not closed under subtraction. We also show that every non-negative real number is the stable commutator length of an element in some infinitely presented small cancellation group.

comments welcome