Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0706.0549

A primer on computational group homology and cohomology

David Joyner
View original source ↗Read source document ↗Export metadata ↓

Abstract

These are expanded lecture notes of a series of expository talks surveying basic aspects of group cohomology and homology. They were written for someone who has had a first course in graduate algebra but no background in cohomology. You should know the definition of a (left) module over a (non-commutative) ring, what $\zzz[G]$ is (where $G$ is a group written multiplicatively and $\zzz$ denotes the integers), and some ring theory and group theory. However, an attempt has been made to (a) keep the presentation as simple as possible, (b) either provide an explicit reference of proof of everything. Several computer algebra packages are used to illustrate the computations, though for various reasons we have focused on the free, open source packages such as GAP and SAGE.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

David Joyner. 2009-06-10. A primer on computational group homology and cohomology. https://arxiv.org/abs/0706.0549

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗