Searcharxiv⌕ Search

arXiv · 2611.22082

Enumerating orbits of finite classical groups on their Lie algebras

Abstract

We enumerate the orbits of a finite classical group in the adjoint action on its Lie algebra, giving exact generating functions and very good upper bounds. We treat the general linear, unitary, symplectic and orthogonal groups, in both odd and even characteristic. In even characteristic, we get very nice formulas for the number of orbits on nilpotent classes both in the finite and algebraically closed case. We discuss the connection with commuting varieties.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jason Fulman, Robert M. Guralnick, Richard Stong. 2026-11-17. Enumerating orbits of finite classical groups on their Lie algebras. https://searcharxiv.com/abs/2611.22082

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗