Engel probability in wreath products of p-groups

Abstract

We give upper and lower bounds for the number of solutions of the equation en(x,y) = g in the group Wk=(Cp Cpk)2, where en(x,y) is the n-th Engel word and g∈ Wk. We obtain several corollaries from this. First, we prove a stronger version of the Amit-Ashurst conjecture for Engel words in Wk. We also prove that Engel words are not probabilistic identities in profinite groups with arbitrarily large wreath product quotients Wk. To conclude, we construct closed subsets of (Cpp)2 with positive Haar measure, empty-interior, and which are the preimage of an Engel word map.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…