SearcharxivSearch

arXiv · 2007.09253

$p$-permutation equivalences between blocks of group algebras

Abstract

We extend the notion of a {$p$-permutation equivalence} between two $p$-blocks $A$ and $B$ of finite groups $G$ and $H$, from the definition in [Boltje-Xu 2008] to a virtual $p$-permutation bimodule whose components have twisted diagonal vertices. It is shown that various invariants of $A$ and $B$ are preserved, including defect groups, fusion systems, and K\"ulshammer-Puig classes. Moreover it is shown that $p$-permutation equivalences have additional surprising properties. They have only one constituent with maximal vertex and the set of $p$-permutation equivalences between $A$ and $B$ is finite (possibly empty). The paper uses new methods: a consequent use of module structures on subgroups of $G\times H$ arising from Brauer constructions which in general are not direct product subgroups, the necessary adaptation of the notion of tensor products between bimodules, and a general formula (stated in these new terms) for the Brauer construction of a tensor product of $p$-permutation bimodules.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert Boltje, Philipp Perepelitsky. 2020-07-17. $p$-permutation equivalences between blocks of group algebras. https://arxiv.org/abs/2007.09253

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