← All problems

Effective Larsen–Shalev conjecture for automorphic word maps

10 years old · traced to

Let ww be a nonempty reduced word in dd distinct variables, and let N(w),η(w)>0N(w),\eta(w)>0 be the constants in the Larsen–Shalev conjecture for automorphic word maps.

Effective Larsen–Shalev conjecture. The constants N(w)N(w) and η(w)\eta(w) can be computed algorithmically from the word ww as input.

This is explicitly described as a slightly stronger version of the preceding conjecture. It would provide effective quantitative control for automorphic word maps, and the source uses it as the hypothesis for deriving an algorithmic statement about solvable radicals.

References
  1. Alexander Bors, “Fibers of automorphic word maps and an application to composition factors”, arXiv:1608.00131 (2016).

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.