SearcharxivSearch

arXiv · 0711.2959

On conjugacy of unipotent elements in finite groups of Lie type

Abstract

Let $\bfG$ be a connected reductive algebraic group defined over $\F_q$, where $q$ is a power of a prime $p$ that is good for $\bfG$. Let $F$ be the Frobenius morphism associated with the $\FF_q$-structure on $\bfG$ and set $G = \bfG^F$, the fixed point subgroup of $F$. Let $\bfP$ be an $F$-stable parabolic subgroup of $\bfG$ and let $\bfU$ be the unipotent radical of $\bfP$; set $P = \bfP^F$ and $U = \bfU^F$. Let $G_\uni$ be the set of unipotent elements in $G$. In this note we show that the number of conjugacy classes of $U$ in $G_\uni$ is given by a polynomial in $q$ with integer coefficients.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon M. Goodwin, Gerhard Roehrle. 2008-07-11. On conjugacy of unipotent elements in finite groups of Lie type. https://arxiv.org/abs/0711.2959

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