SearcharxivSearch

arXiv · 2509.21139

Rigid automorphisms of linking systems of finite groups of Lie type

Abstract

Let $\mathcal{L}$ be a centric linking system associated to a saturated fusion system on a finite $p$-group $S$. An automorphism of $\mathcal{L}$ is said to be rigid if it restricts to the identity on the fusion system. An inner rigid automorphism is conjugation by some element of the center of $S$. If $\mathcal{L}$ is the centric linking system of a finite group $G$, then rigid automorphisms of $\mathcal{L}$ are closely related to automorphisms of $G$ that centralize $S$. For odd primes, all rigid automorphisms are known to be inner, but this fails for the prime 2. We determine which known quasisimple linking systems at the prime 2 have a noninner rigid automorphism. Based on previous results, this reduces to handling the case of the linking systems at the prime 2 of finite simple groups of Lie type in odd characteristic. These have no noninner rigid automorphisms with two families of exceptions: the 2-dimensional projective special linear groups and even-dimensional orthogonal groups for quadratic forms of nonsquare discriminant.

Explore related subjects

Keep this discovery

BibTeXRIS

Jonathon Villareal. 2025-09-25. Rigid automorphisms of linking systems of finite groups of Lie type. https://arxiv.org/abs/2509.21139

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