SearcharxivSearch

arXiv · 0901.0667

Counting conjugacy classes in the unipotent radical of parabolic subgroups of $\GL_n(q)$

Abstract

Let $q$ be a power of a prime $p$. Let $P$ be a parabolic subgroup of the general linear group $\GL_n(q)$ that is the stabilizer of a flag in $\FF_q^n$ of length at most 5, and let $U = O_p(P)$. In this note we prove that, as a function of $q$, the number $k(U)$ of conjugacy classes of $U$ is a polynomial in $q$ with integer coefficients.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon M. Goodwin, Gerhard Roehrle. 2009-06-16. Counting conjugacy classes in the unipotent radical of parabolic subgroups of $\GL_n(q)$. https://arxiv.org/abs/0901.0667

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