SearcharxivSearch

arXiv · 2302.06160

Generalized Periodicity in Group Cohomology

Abstract

Given a finite group $G$, we introduce "encoding pairs," which are a pair of $G$-modules $M$ and $M'$ equipped with a shifted natural isomorphism between the cohomological functors $H^\bullet(G,\mathrm{Hom}_\mathbb Z(M,-))$ and $H^\bullet(G,\mathrm{Hom}_\mathbb Z(M',-))$. Studying these encoding pairs generalizes the theory of periodic cohomology for finite groups, allowing us to generalize the cohomological input of a theorem due to Swan that roughly says that a finite group with periodic cohomology acts feely on some sphere.

Explore related subjects

Keep this discovery

BibTeXRIS

Nir Elber. 2023-02-13. Generalized Periodicity in Group Cohomology. https://doi.org/10.1080/00927872.2023.2296883

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