Search arXivSearch

arXiv · math/0409452

On the order of finite semisimple groups

Abstract

It is a theorem of Artin, Tits et al. that a finite simple group is determined by its order, with the exception of the groups (A_3(2), A_2(4)) and (B_n(q), C_n(q)) for n > 2, q odd. We investigate the situation for finite semisimple groups of Lie type. It turns out that the order of the finite group H(F_q) for a split semisimple algebraic group H defined over F_q, does not determine the group H upto isomorphism, but it determines the field F_q under some mild conditions. We then put a group structure on the pairs (H_1, H_2) of split semisimple groups defined over a fixed field F_q such that the orders of the finite groups H_1(F_q) and H_2(F_q) are the same and the groups H_i have no common simple direct factors. We obtain an explicit set of generators for this abelian, torsion-free group. We finally give a geometric reasoning for these order coincidences.

Explore related subjects

Keep this discovery

BibTeXRIS

Shripad M. Garge. 2006-01-13. On the order of finite semisimple groups. https://arxiv.org/abs/math/0409452

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