SearcharxivSearch

arXiv · 2402.08357

The binary actions of simple groups of Lie type of characteristic 2

Abstract

Let $\mathcal{C}$ be a conjugacy class of involutions in a group $G$. We study the graph $\Gamma(\mathcal{C})$ whose vertices are elements of $\mathcal{C}$ with $g,h\in\mathcal{C}$ connected by an edge if and only if $gh\in\mathcal{C}$. For $t\in \mathcal{C}$, we define the component group of $t$ to be the subgroup of $G$ generated by all vertices in $\Gamma(\mathcal{C})$ that lie in the connected component of the graph that contains $t$. We classify the component groups of all involutions in simple groups of Lie type over a field of characteristic $2$. We use this classification to partially classify the transitive binary actions of the simple groups of Lie type over a field of characteristic $2$ for which a point stabilizer has even order. The classification is complete unless the simple group in question is a symplectic or unitary group.

Explore related subjects

Keep this discovery

BibTeXRIS

Nick Gill, Pierre Guillot, Martin W. Liebeck. 2024-02-13. The binary actions of simple groups of Lie type of characteristic 2. https://doi.org/10.2140/pjm.2025.336.113

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