Random stable commutator length conjecture for hyperbolic groups

Let GG be a hyperbolic group with finite generating set SS, and let λ\lambda be such that the number of elements of length nn is Θ(λn)\Theta(\lambda^n). Let vv be a random element of word length nn, conditioned to lie in the commutator subgroup [G,G][G,G]. Random stable commutator length conjecture. For any ϵ>0\epsilon>0 and C>1C>1,

scl(v)log(n)/nlog(λ)/6ϵ\left|\operatorname{scl}(v)\log(n)/n - \log(\lambda)/6\right| \le \epsilon

with probability 1O(nC)1-O(n^{-C}). The conjecture predicts the typical asymptotic stable commutator length of random homologically trivial elements in arbitrary hyperbolic groups; the source presents it as a technically involved generalization of the results established earlier in the paper, and gives no resolution.

Sources & referencesView supporting material

Primary source

Danny Calegari and Alden Walker, “Random rigidity in the free group”, arXiv:1104.1768 (2013).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.