SearcharxivSearch

arXiv · 1506.02310

Rational discrete first degree cohomology for totally disconnected locally compact groups

Abstract

It is well-known that the existence of more than two ends in the sense of J.R. Stallings for a finitely generated discrete group $G$ can be detected on the cohomology group $\mathrm{H}^1(G,R[G])$, where $R$ is either a finite field, the ring of integers or the field of rational numbers. It will be shown (cf. Theorem A*) that for a compactly generated totally disconnected locally compact group $G$ the same information about the number of ends of $G$ in the sense of H. Abels can be provided by $\mathrm{dH}^1(G,\mathrm{Bi}(G))$, where $\mathrm{Bi}(G)$ is the rational discrete standard bimodule of $G$, and $\mathrm{dH}^\bullet(G,\_)$ denotes rational discrete cohomology as introduced in [6]. As a consequence one has that the class of fundamental groups of a finite graph of profinite groups coincides with the class of compactly presented totally disconnected locally compact groups of rational discrete cohomological dimension at most 1 (cf. Theorem B).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ilaria Castellano. 2017-03-15. Rational discrete first degree cohomology for totally disconnected locally compact groups. https://doi.org/10.1017/s0305004118000762

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