SearcharxivSearch

arXiv · math/9812167

Simplicite de groupes d'automorphismes d'espaces a courbure negative

Abstract

We prove that numerous negatively curved simply connected locally compact polyhedral complexes, admitting a discrete cocompact group of automorphisms, have automorphism groups which are locally compact, uncountable, non linear and virtually simple. Examples include hyperbolic buildings, Cayley graphs of word hyperbolic Coxeter systems, and generalizations of cubical complexes, that we call even polyhedral complexes. We use tools introduced by Tits in the case of automorphism groups of trees, and Davis-Moussong's geometric realisation of Coxeter systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frederic Haglund, Frederic Paulin. 1998-12-04. Simplicite de groupes d'automorphismes d'espaces a courbure negative. https://arxiv.org/abs/math/9812167

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