Search arXivSearch

arXiv · math/0703356

Rational $p$-biset functors

Abstract

In this paper, I give several characterizations of {\em rational biset functors over $p$-groups}, which are independent of the knowledge of genetic bases for $p$-groups. I also introduce a construction of new biset functors from known ones, which is similar to the Yoneda construction for representable functors, and to the Dress construction for Mackey functors, and I show that this construction preserves the class of rational $p$-biset functors.\par This leads to a characterization of rational $p$-biset functors as additive functors from a specific quotient category of the biset category to abelian groups. Finally, I give a description of the largest rational quotient of the Burnside $p$-biset functor : when $p$ is odd, this is simply the functor $R_\Q$ of rational representations, but when $p=2$, it is a non split extension of $R_\Q$ by a specific uniserial functor, which happens to be closely related to the functor of units of the Burnside ring.

Explore related subjects

Keep this discovery

BibTeXRIS

Serge Bouc. 2007-03-12. Rational $p$-biset functors. https://arxiv.org/abs/math/0703356

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