ℓ∞-Cohomology: Amenability, relative hyperbolicity, isoperimetric inequalities and undecidability

We revisit Gersten’s [Formula: see text]-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 [Formula: see text]-cohomology, and generalize Mineyev’s characterization of hyperbolic groups via [Formula: see text]-cohomology to the relative setting. We then describe how [Formula: see text]-cohomology is related to isoperimetric inequalities. We also consider some algorithmic problems concerning [Formula: see text]-cohomology and show that they are undecidable. In Appendix A, we prove a version of the de Rham’s theorem in the context of [Formula: see text]-cohomology.

Authors

Institutions

Publication Details

Journal
Journal of Topology and Analysis
Published
2025-08-09
DOI
https://doi.org/10.1142/s1793525325500268
Citations
1
Primary Topic
Point processes and geometric inequalities
Type
article
Field-Weighted Citation Impact
3.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ℓ∞-Cohomology: Amenability, relative hyperbolicity, isoperimetric inequalities and undecidability

Francesco Milizia
1 citations
Journal of Topology and Analysis
Point processes and geometric inequalities
3.73
article

ℓ∞-Cohomology: Amenability, relative hyperbolicity, isoperimetric inequalities and undecidability

Francesco Milizia
article en
1 citations

Abstract

We revisit Gersten’s [Formula: see text]-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 [Formula: see text]-cohomology, and generalize Mineyev’s characterization of hyperbolic groups via [Formula: see text]-cohomology to the relative setting. We then describe how [Formula: see text]-cohomology is related to isoperimetric inequalities. We also consider some algorithmic problems concerning [Formula: see text]-cohomology and show that they are undecidable. In Appendix A, we prove a version of the de Rham’s theorem in the context of [Formula: see text]-cohomology.

Journal of Topology and Analysis
Scuola Normale Superiore (IT)
Reduced inequalities
Openalex Percentile: Top 8%
Point processes and geometric inequalities
3.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.