The concentration conjecture for random stable commutator length

Let (G,μ,Y)(G,\mu,Y) be nondegenerate in the sense of Definition~, and let gg be obtained by an even-length random walk on GG, conditioned to lie in [G,G][G,G]. Concentration conjecture. There are constants C>0C>0 and C1>0C_1>0 such that, for every ϵ>0\epsilon>0,

P(scl(g)lognnCϵ)1enC1.{\mathbf P}\left(\left|\operatorname{scl}(g)\frac{\log n}{n}-C\right|\le\epsilon\right)\ge 1-e^{-n^{C_1}}.

This is proposed as a sharpening of the paper's order-of-growth estimates for stable commutator length; no resolution is supplied.

Sources & referencesView supporting material

Primary source

Danny Calegari and Joseph Maher, “Statistics and compression of scl”, arXiv:1008.4952 (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.