SearcharxivSearch

arXiv · 2411.05700

Diagonal $p$-permutation functors in characteristic $p$

Abstract

Let $p$ be a prime number. We consider diagonal $p$-permutation functors over a (commutative, unital) ring $\mathsf{R}$ in which all prime numbers different from $p$ are invertible. We first determine the finite groups $G$ for which the associated essential algebra $\mathcal{E}_\mathsf{R}(G)$ is non zero: These are groups of the form $G=L\rtimes \langle u\rangle$, where $(L,u)$ is a $D^\Delta$-pair. When $\mathsf{R}$ is an algebraically closed field $\mathbb{F}$ of characteristic 0 or $p$, this yields a parametrization of the simple diagonal $p$-permutation functors over $\mathbb{F}$ by triples $(L,u,W)$, where $(L,u)$ is a $D^\Delta$-pair, and $W$ is a simple $\mathbb{F}\mathrm{Out}(L,u)$-module. Finally, we describe the evaluations of the simple functor $\mathsf{S}_{L,u,W}$ parametrized by the triple $(L,u,W)$. We show in particular that if $G$ is a finite group and $\mathbb{F}$ has characteristic $p$, the dimension of $\mathsf{S}_{L,1,\mathbb{F}}(G)$ is equal to the number of conjugacy classes of $p$-regular elements of $G$ with defect isomorphic to $L$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Serge Bouc, Deniz Yılmaz. 2024-11-08. Diagonal $p$-permutation functors in characteristic $p$. https://arxiv.org/abs/2411.05700

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