SearcharxivSearch

arXiv · 2604.21738

On the induction functor from group algebras to distribution algebras

Abstract

Let $G$ be a reductive algebraic group scheme defined over ${\mathbb F}_{p}$ and $k$ be an algebraically closed field of characteristic $p$. There are two associated families of finite group schemes, the $r$-th Frobenius kernels, denoted by $G_r$, and the fixed points of the iterated Frobenius map, the finite groups of Lie type, denoted by $G(\mathbb{F}_q).$ Bendel, Nakano and Pillen initiated the investigation of the induction functor $\operatorname{ind}_{G(\mathbb{F}_q)}^G-$. Using filtrations and truncation, large amounts of data coming from the algebraic group and the Frobenius kernels can be transferred to the finite group. This paper looks at connections between a fundamental theorem of Chastkofsky and Jantzen and the induction functor via the cohomology and representation theory of $G$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christopher P. Bendel, Daniel K. Nakano, Cornelius Pillen. 2026-04-23. On the induction functor from group algebras to distribution algebras. https://arxiv.org/abs/2604.21738

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