SearcharxivSearch

arXiv · 2505.21029

Strict C(6) complexes

Abstract

We define strict C(n) small-cancellation complexes, intermediate to C(n) and C(n+1), and we prove groups acting properly cocompactly on a simply-connected strict C(6) complex are hyperbolic relative to a collection of maximal virtually free abelian subgroups of rank 2. We study geometric walls in a simply-connected strict C(6) complex, and we use them to prove a convex cocompact (cosparse) core theorem for (relatively) quasiconvex subgroups of strict C(6) groups. We provide an examples showing the convex cocompact core theorem is false without the strict C(6) assumption.

Explore related subjects

Keep this discovery

BibTeXRIS

Zachary Munro, Daniel T. Wise. 2025-05-27. Strict C(6) complexes. https://arxiv.org/abs/2505.21029

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