The NLB conjecture for nontrivial words

For a positive integer dd, let F(X1,,Xd)\operatorname{F}(X_1,\ldots,X_d) be the free group on X1,,XdX_1,\ldots,X_d, and let wF(X1,,Xd)w\in\operatorname{F}(X_1,\ldots,X_d) be a nontrivial word. For a finite group GG, write λ(G)\lambda(G) for its nonsolvable length. We say that ww is nonsolvable-length-bounding if there is a function fw:(0,1][0,]f_w:(0,1]\rightarrow[0,\infty] such that, for every ρ(0,1]\rho\in(0,1] and every finite group GG, whenever some fiber of the word map wG:GdGw_G:G^d\rightarrow G has proportion at least ρ\rho, one has λ(G)fw(ρ)\lambda(G)\leq f_w(\rho). NLB conjecture. Every nontrivial word is nonsolvable-length-bounding. This conjecture is due to Michael Larsen and is described as very challenging; even the case ρ=1\rho=1, when ww is an identity of GG, is unknown.

Sources & referencesView supporting material

Primary source

Alexander Bors and Aner Shalev, “Words, permutations, and the nonsolvable length of a finite group”, arXiv:1904.02370 (2019).

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.