SearcharxivSearch

arXiv · 2607.11605

Engel probability in wreath products of $p$-groups

Abstract

We give upper and lower bounds for the number of solutions of the equation $e_n(x,y) = g$ in the group $W_k=(C_p\wr C_{p^k})^2$, where $e_n(x,y)$ is the $n$-th Engel word and $g\in W_k$. We obtain several corollaries from this. First, we prove a stronger version of the Amit-Ashurst conjecture for Engel words in $W_k$. We also prove that Engel words are not probabilistic identities in profinite groups with arbitrarily large wreath product quotients $W_k$. To conclude, we construct closed subsets of $(C_p\wr\Z_p)^2$ with positive Haar measure, empty-interior, and which are the preimage of an Engel word map.

Explore related subjects

Keep this discovery

BibTeXRIS

Iker de las Heras, Tommaso Toti, Matteo Vannacci. 2026-07-13. Engel probability in wreath products of $p$-groups. https://arxiv.org/abs/2607.11605

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR