SearcharxivSearch

arXiv · 2303.06976

Stable functorial equivalence of blocks

Abstract

Let $k$ be an algebraically closed field of characteristic $p>0$, let $R$ be a commutative ring and let $\mathcal{F}$ be an algebraically closed field of characteristic $0$. We introduce the category $\overline{\mathcal{F}_{Rpp_k}}$ of stable diagonal $p$-permutation functors over $R$. We prove that the category $\overline{\mathcal{F}_{\mathbb{F}pp_k}}$ is semisimple and give a parametrization of its simple objects in terms of the simple diagonal $p$-permutation functors. We also introduce the notion of a stable functorial equivalence over $R$ between blocks of finite groups. We prove that if $G$ is a finite group and if $b$ is a block idempotent of $kG$ with an abelian defect group $D$ and Frobenius inertial quotient $E$, then there exists a stable functorial equivalence over $\mathbb{F}$ between the pairs $(G,b)$ and $(D\rtimes E,1)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Serge Bouc, Deniz Yılmaz. 2023-03-13. Stable functorial equivalence of blocks. https://arxiv.org/abs/2303.06976

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