SearcharxivSearch

arXiv · math/0303187

Dickson invariants, regularity and computation in group cohomology

Abstract

In this paper, we investigate the commutative algebra of the cohomology ring $H^*(G,k)$ of a finite group $G$ over a field $k$. We relate the concept of quasi-regular sequence, introduced by Benson and Carlson, to the local cohomology of the cohomology ring. We give some slightly strengthened versions of quasi-regularity, and relate one of them to Castelnuovo--Mumford regularity. We prove that the existence of a quasi-regular sequence in either the original sense or the strengthened ones is true if and only if the Dickson invariants form a quasi-regular sequence in the same sense. The proof involves the notion of virtual projectivity, introduced by Carlson, Peng and Wheeler. As a by-product of this investigation, we give a new proof of the Bourguiba--Zarati theorem on depth and Dickson invariants, in the context of finite group cohomology, without using the machinery of unstable modules over the Steenrod algebra. Finally, we describe an improvement of Carlson's algorithm for computing the cohomology of a finite group using a finite initial segment of a projective resolution of the trivial module. In contrast to Carlson's algorithm, ours does not depend on verifying any conjectures during the course of the calculation, and is always guaranteed to work.

Explore related subjects

Keep this discovery

BibTeXRIS

David Benson. 2003-03-15. Dickson invariants, regularity and computation in group cohomology. https://arxiv.org/abs/math/0303187

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