Amit's conjecture on word-map fibers in finite nilpotent groups

About 8 years old · traced to

Let GG be a finite nilpotent group, let x‾\overline{x} denote a tuple of variables, and let w(x‾)w(\overline{x}) be a word map on GG. Write μG,w(1)\mu_{G,w}(1) for the probability that w(x‾)=1w(\overline{x})=1 when x‾\overline{x} is chosen uniformly from G∣x‾∣G^{|\overline{x}|}. Amit's conjecture. For every such word map,

μG,w(1)≥1∣G∣,\mu_{G,w}(1)\geq \frac{1}{|G|},

i.e. the equation w(x‾)=1w(\overline{x})=1 has at least ∣G∣∣x‾∣−1|G|^{|\overline{x}|-1} solutions. This generalizes the preceding result for equations of the form w(x‾)=c(x‾)w(\overline{x})=c(\overline{x}) with cc in the derived subgroup of the free group over GG; its status is not resolved in the supplied source context.

References

Primary source

William Cocke and Meng-Che "Turbo" Ho, “The Probability Distribution of Word Maps on Finite Groups”, arXiv:1807.07111 (2018).

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.