∞-cohomology: amenability, relative hyperbolicity, isoperimetric inequalities and undecidability
Abstract
We revisit Gersten's ∞-cohomology of groups and spaces, removing the finiteness assumptions required by the original definition while retaining its geometric nature. Mirroring the corresponding results in bounded cohomology, we provide a characterization of amenable groups using ∞-cohomology, and generalize Mineyev's characterization of hyperbolic groups via ∞-cohomology to the relative setting. We then describe how ∞-cohomology is related to isoperimetric inequalities. We also consider some algorithmic problems concerning ∞-cohomology and show that they are undecidable. In an appendix, we prove a version of the de Rham's theorem in the context of ∞-cohomology.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.