SearcharxivSearch

arXiv · math/0001031

Conjugacy classes in maximal parabolic subgroups of general linear groups

Abstract

We compute conjugacy classes in maximal parabolic subgroups of the general linear group. This computation proceeds by reducing to a ``matrix problem''. Such problems involve finding normal forms for matrices under a specified set of row and column operations. We solve the relevant matrix problem in small dimensional cases. This gives us all conjugacy classes in maximal parabolic subgroups over a perfect field when one of the two blocks has dimension less than 6. In particular, this includes every maximal parabolic subgroup of GL_n(k) for n < 12 and k a perfect field. If our field is finite of size q, we also show that the number of conjugacy classes, and so the number of characters, of these groups is a polynomial in $q$ with integral coefficients.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Scott H. Murray. 2000-01-06. Conjugacy classes in maximal parabolic subgroups of general linear groups. https://arxiv.org/abs/math/0001031

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