Comparing word probabilities in finite groups

Source abstract

We use results from extremal graph theory and analysis to compare word probabilities in finite groups. In particular, we show that the probability of satisfying the 2-Engel word admits a positive lower bound in terms of the probability that an element has order dividing 3. More generally, using a group removal lemma, we obtain analogous bounds for $x^m$-good words.