Searcharxiv⌕ Search

arXiv · 2611.21492

Expansion in powers of simple groups of Lie type

Abstract

We prove an expansion theorem for direct powers of all nonabelian finite simple groups $G$ other than the alternating groups and the Suzuki groups ${}^2B_2(q)$. If $G^m$ is generated by $d\ge2$ elements, then $G^m$ has a symmetric generating multiset of at most $Cd$ elements and normalized spectral gap at least $C^{-1}d^{-\log_2 3}$, for an absolute constant $C>0$. In particular, this answers a question of Sabatini on $\mathrm{PSL}_2(\mathbb{F}_p)^p$. For $\mathrm{PSL}_2(\mathbb{F}_q)$, we use the expander graphs constructed by Lubotzky--Samuels--Vishne, and an amplification trick for direct powers; in high rank, we use the Ershov--Jaikin-Zapirain property (T) theorem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Lubotzky, Yotam Shomroni. 2026-11-16. Expansion in powers of simple groups of Lie type. https://searcharxiv.com/abs/2611.21492

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗