The NLB conjecture for nontrivial words
The NLB conjecture for nontrivial words
For a positive integer , let be the free group on , and let be a nontrivial word. For a finite group , write for its nonsolvable length. We say that is nonsolvable-length-bounding if there is a function such that, for every and every finite group , whenever some fiber of the word map has proportion at least , one has . 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 , when is an identity of , 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.