SearcharxivSearch

arXiv · 2310.00237

Galois automorphisms and a unique Jordan decomposition in the case of connected centralizer

Abstract

We show that the Jordan decomposition of characters of finite reductive groups can be chosen so that if the centralizer of the relevant semisimple element in the dual group is connected, then the map is Galois-equivariant. Further, in this situation, we show that there is a unique Jordan decomposition satisfying conditions analogous to those of Digne--Michel's unique Jordan decomposition in the connected center case.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. A. Schaeffer Fry, Jay Taylor, C. Ryan Vinroot. 2023-09-30. Galois automorphisms and a unique Jordan decomposition in the case of connected centralizer. https://arxiv.org/abs/2310.00237

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