Search arXivSearch

arXiv · 2506.10464

Groups represented by incidence geometries

Abstract

The aim of this paper is to use the framework of incidence geometry to develop a theory that permits to model both the inner and outer automorphisms of a group G simultaneously. More precisely, to any group G, we attempt to associate an incidence system whose group of type-preserving automorphisms is Inn(G), the group of inner automorphisms of G, and whose full group of automorphisms is the group Out(G) of outer automorphisms of G, getting what we call an incidence geometric representation theory for groups. Hence, in this setting, the group Inn(G) preserves the types of the associated incidence structure while the group Out(G) is acting non-trivially on the typeset of it, realizing the outer automorphisms of G as correlations. We give examples of incidence geometric representations for the dihedral groups, the symmetric groups, the automorphism groups of the five platonic solids, families of classical groups defined over fields such as the projective linear groups, and finally subgroups of free groups whose outer automorphism group is the largest finite subgroup of their automorphism group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dimitri Leemans, Klara Stokes, Philippe Tranchida. 2025-06-12. Groups represented by incidence geometries. https://arxiv.org/abs/2506.10464

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