Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

$p$-Bifree biset functors (2505.16719v1)

Published 22 May 2025 in math.RT

Abstract: We introduce and study the category of $p$-bifree biset functors for a fixed prime $p$, defined via bisets whose left and right stabilizers are $p'$-groups. This category naturally lies between the classical biset functors and the diagonal $p$-permutation functors, serving as a bridge between them. Every biset functor and every diagonal $p$-permutation functor restricts to a $p$-bifree biset functor. We classify the simple $p$-bifree biset functors over a field $K$ of characteristic zero, showing that they are parametrized by pairs $(G,V)$, where $G$ is a finite group and $V$ is a simple $K\mathrm{Out}(G)$-module. As key examples, we compute the composition factors of several representation-theoretic functors in the $p$-bifree setting, including the Burnside ring functor, the $p$-bifree Burnside functor, the Brauer character ring functor, and the ordinary character ring functor. We further investigate classical simple biset functors, $S_{C_p \times C_p, \mathbb{C}}$ and $S_{C_q \times C_q, \mathbb{C}}$ for a prime $q\neq p$.

Summary

We haven't generated a summary for this paper yet.