SearcharxivSearch

arXiv · math/0607703

The functor of units of Burnside rings for p-groups

Abstract

In this note I describe the structure of the biset functor $B^\times$ sending a $p$-group $P$ to the group of units of its Burnside ring $B(P)$. In particular, I show that $B^\times$ is a rational biset functor. It follows that if $P$ is a $p$-group, the structure of $B^\times(P)$ can be read from a genetic basis of $P$: the group $B^\times(P)$ is an elementary abelian 2-group of rank equal to the number isomorphism classes of rational irreducible representations of $P$ whose type is trivial, cyclic of order 2, or dihedral.

Explore related subjects

Keep this discovery

BibTeXRIS

Serge Bouc. 2006-07-27. The functor of units of Burnside rings for p-groups. https://arxiv.org/abs/math/0607703

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