Search arXivSearch

arXiv · 1601.00795

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

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 $Ω(t \log |G|)$ when $G$ is a finite simple group of Lie type of bounded rank, and at least $Ω(t \log \log |G|)$ when $G$ is any finite simple group. Both these bounds are best possible.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aner Shalev. 2016-01-24. Simple groups, interleaved products, complexity and conjectures of Gowers and Viola. https://arxiv.org/abs/1601.00795

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

KEEP EXPLORING

Related papers

Word Measures on Wreath Products II

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients: the $w$-expectations $E_w[χ]$ of the irreducible characters of $G$. For every finite group $G$, every stable character $χ$ of $G\wr S_n$ (trace of a finitely generated $FI_G$-module), and every word $w\in F_r$, we approximate $E_w[χ]$ up to an error term of $O(n^{-π(w)})$, where $π(w)$ is the primitivity rank of $w$. This generalizes previous works by Puder, Hanany, Magee and the author. As an application we show that random Schreier graphs of representation-stable actions of $G\wr S_n$ are close-to-optimal expanders. The paper reveals a surprising relation between stable representation theory of wreath products and not-necessarily connected Stallings core graphs.

math.GR

Robust quasi-isometric embeddings inapproximable by Anosov representations

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. For all but finitely many $m\in \mathbb{N}$, we exhibit the first examples of non-locally rigid, Zariski dense, robust quasi-isometric embeddings of hyperbolic groups in $\mathsf{SL}_m(\mathbb{K})$ which are not limits of Anosov representations. As a consequence, we show that higher rank analogues of Sullivan's structural stabilty theorem and of the density theorem for Kleinian groups fail for Anosov representations in $\mathsf{SL}_m(\mathbb{C}), m\geq 30$.

math.GR

$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove that the Grigorchuk group is 2-hereditarily conjugacy separable. As an application, we demonstrate that the lamplighter groups and $\mathbb{Z} \wr \mathbb{Z}$ are hereditarily conjugacy separable (but not $p$-conjugacy separable for any prime $p$). This provides infinitely many new examples of solvable, non-polycyclic hereditarily conjugacy separable groups. Furthermore, we study wreath products of cyclic subgroup separable groups and the derived length of iterated wreath products of solvable groups with an abelian base group and, as an application, we give an explicit construction of non-polycyclic hereditarily conjugacy separable groups of arbitrary derived length as iterated wreath products of abelian groups.

math.GR