SearcharxivSearch

arXiv · 1707.06624

A complex euclidean reflection group with an elegant complement complex

Abstract

The complement of a hyperplane arrangement in $\mathbb{C}^n$ deformation retracts onto an $n$-dimensional cell complex, but the known procedures only apply to complexifications of real arrangements (Salvetti) or the cell complex produced depends on an initial choice of coordinates (Björner-Ziegler). In this article we consider the unique complex euclidean reflection group acting cocompactly by isometries on $\mathbb{C}^2$ whose linear part is the finite complex reflection group known as $G_4$ in the Shephard-Todd classification and we construct a choice-free deformation retraction from its hyperplane complement onto an elegant $2$-dimensional complex $K$ where every $2$-cell is a euclidean equilateral triangle and every vertex link is a Möbius-Kantor graph. Since $K$ is non-positively curved, the corresponding braid group is a CAT(0) group, despite the fact that there are non-regular points in the hyperplane complement, the action of the reflection group on $K$ is not free, and the braid group is not torsion-free.

Explore related subjects

Keep this discovery

BibTeXRIS

Ben Coté, Jon McCammond. 2017-07-20. A complex euclidean reflection group with an elegant complement complex. https://arxiv.org/abs/1707.06624

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