Simple groups, interleaved products, complexity and conjectures of Gowers and Viola

TL;DR

This paper investigates the distribution of products of conjugacy classes in finite simple groups, proving uniformity results that support conjectures of Thompson and solving recent conjectures on interleaved products and complexity bounds, extending prior work to all nonabelian finite simple groups.

Contribution

It provides effective uniformity results for products in finite simple groups, confirming conjectures of Gowers and Viola and extending their results to all nonabelian finite simple groups.

Findings

Interleaved products are nearly uniform on finite simple groups with quantitative bounds.

Communication complexity of related decision problems is at least proportional to t log |G|.

Results extend previous work from SL(2,q) to all nonabelian finite simple groups.

Abstract

We study the distribution of products of conjugacy classes in finite simple groups, obtaining various effective uniformity results, which give rise to an approximation to a conjecture of Thompson. Our results, combined with work of Gowers and Viola, also lead to the solution of recent conjectures they posed on interleaved products and related complexity lower bounds, extending their work on the groups SL$(2,q)$ to all (nonabelian) finite simple groups. In particular it follows that, if $G$ is a finite simple group, and $A, B \subseteq G^t$ for $t \ge 2$ are subsets of fixed positive densities, then, as $a = (a_1, \ldots , a_t) \in A$ and $b = (b_1, \ldots , b_t) \in B$ are chosen uniformly, the interleaved product $a \bullet b := a_1b_1 \cdots a_tb_t$ is almost uniform on $G$ (with quantitative estimates) with respect to the $\ell_{\infty}$-norm. It also follows that the communication complexity of an old decision problem related to interleaved products of $a, b \in G^t$ is at least $\Omega(t \log |G|)$ when $G$ is a finite simple group of Lie type of bounded rank, and at least $\Omega(t \log \log |G|)$ when $G$ is any finite simple group. Both these bounds are best possible.