Acylindrical hyperbolicity of graphical small cancellation groups
We prove the theorem in the title and use it to exhibit new behaviours for the divergence function of a group.
Graphical small cancellation
It is an extension of small cancellation theory, devised by Gromov, in order to construct a finitely presented group weakly containing an expander. Gromov’s full construction uses (pseudo-)random choices, so the resulting presentation is not explicit. We shall not need these unpleasant steps, our presentations will be explicit.
Data: a graph , edge orientations, edge labels in . Consider the set of words read along closed paths. This is a normal subgroup of a free group, hence a quotient group .
By construction, maps to . Need not be injective, unless we add assumptions: small cancellation.
A piece is a labelled path that has at least two dustinct label-preserving maps to . Say (and ) satisfies if ratios length of pieces over girth of are .
Classical small cancellation amounts to being a union of cycles. The language of van Kampen diagrams applies here as usual.
Theorem 1 (Gromov, Ollivier 2006) If is a finite graph, then is hyperbolic, and every component of embeds isometrically into .
Theorem 2 (Gruber 2012) Let is graph, then is lacunary hyperbolic (i.e. at least one asymptotic cone is a real tree)
Theorem 3 (Gruber-Sisto) Let is graph, then is acylindrically hyperbolic.
1. Acylindrical hyperbolicity
See Hume and Sisto’s talks. The hyperbolic space on which acts is the Cayley graph of with respect to the (infinite) generating system consisting in and the set of all words read along paths in .
We use Strebel’s classification of geodesic triangles in small cancellation groups. There are 7 cases, the hyperbolicity constant is at most 2. Strebel’s argument goes through and shows that is 4-hyperbolic.
We show that all hyperbolic elements satisfy WPD. Thin quadrangles have width at most 2 in the middle.
measures the geodesic distance outside balls of radius . This a quasiisometry invariant. Examples with linear, quadratic, cubic, exponential divergence are known.
We show examples where the lim inf of is 0, but the lim sup of is for every prescribed subexponential function.
We use large powers a WPD element to produce bridges that reduce divergence. Since, at every finite step of the construction, the group is hyperbolic, and this has exponential divergence, we may keep adding larger and larger relators to produce large (but subexponential) values of divergence.