SearcharxivSearch

arXiv · 2510.23957

Simultaneous ping-pong for finite subgroups of reductive groups

Abstract

Let $\Gamma$ be a Zariski-dense subgroup of a reductive group $\mathbf{G}$ defined over a field $F$. Given a finite collection of finite subgroups $H_i$ ($i \in I$) of $\mathbf{G}(F)$ avoiding the center, we establish a criterion to ensure that the set of elements of $\Gamma$ that form a free product with every $H_i$ (the so-called simultaneous ping-pong partners for $H_i$) is both Zariski- and profinitely dense in $\Gamma$. This criterion applies namely to direct products $\mathbf{G}$ of inner $\mathbb{R}$-forms of $\operatorname{(P)GL}_n$, and gives a positive answer to this particular case of a question asked by Bekka, Cowling and de la Harpe. For torsion elements, a complication arises due to the fact that a finite cyclic group can split into a direct product. When $\mathbf{G}$ is the multiplicative group of a semisimple algebra, we also give a more explicit method to obtain free products between two given finite subgroups, via first-order deformations. In the second half, we investigate the case where $\mathbf{G}$ is the multiplicative group of the group algebra $FG$ of a finite group $G$, and $\Gamma$ is the group of units of an order in $FG$. In this regard, we prove that the set of bicylic units that play ping-pong with a given shifted bicyclic unit, is Zariski- and profinitely dense, addressing a long-standing belief in the field of group rings. This result is deduced from the criterion above, combined with sharp existence results for well-behaved irreducible representations of $G$ that are center-preserving on a given subgroup.

Explore related subjects

Keep this discovery

BibTeXRIS

Geoffrey Janssens, Doryan Temmerman, François Thilmany. 2025-10-28. Simultaneous ping-pong for finite subgroups of reductive groups. https://arxiv.org/abs/2510.23957

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