SearcharxivSearch

arXiv · 2109.07891

Lattices, injective metrics and the $K(\pi,1)$ conjecture

Abstract

Starting with a lattice with an action of $\mathbb{Z}$ or $\mathbb{R}$, we build a Helly graph or an injective metric space. We deduce that the $\ell^\infty$ orthoscheme complex of any bounded graded lattice is injective. We also prove a Cartan-Hadamard result for locally injective metric spaces. We apply this to show that any Garside group or any FC type Artin group acts on an injective metric space and on a Helly graph. We also deduce that the natural piecewise $\ell^\infty$ metric on any Euclidean building of type $\tilde{A_n}$ extended, $\tilde{B_n}$, $\tilde{C_n}$ or $\tilde{D_n}$ is injective, and its thickening is a Helly graph. Concerning Artin groups of Euclidean types $\tilde{A_n}$ and $\tilde{C_n}$, we show that the natural piecewise $\ell^\infty$ metric on the Deligne complex is injective, the thickening is a Helly graph, and it admits a convex bicombing. This gives a metric proof of the $K(\pi,1)$ conjecture, as well as several other consequences usually known when the Deligne complex has a CAT(0) metric.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Haettel. 2021-09-16. Lattices, injective metrics and the $K(\pi,1)$ conjecture. https://doi.org/10.2140/agt.2024.24.4007

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