Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0311177

Rigidity of two-dimensional Coxeter groups

Patrick Bahls
View original source ↗Read source document ↗Export metadata ↓

Abstract

A Coxeter system is called two-dimensional if its associated Davis complex is two-dimensional (equivalently, every spherical subgroup has rank less than or equal to 2). We prove that given a two-dimensional system (W,S) and any other system (W,S') which yields the same reflections, the diagrams corresponding to these systems are isomorphic, up to the operation of diagram twisting defined by N. Brady, J. McCammond, B. Muhlherr, and W. Neumann. As a step in the proof of this result, certain two-dimensional groups are shown to be reflection rigid in the sense defined by the above authors, and a result concerning the strong rigidity of two-dimensional systems is given in the final section.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Patrick Bahls. 2004-01-21. Rigidity of two-dimensional Coxeter groups. https://arxiv.org/abs/math/0311177

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗