SearcharxivSearch

arXiv · 2605.29337

Visualizing conjugation in affine Coxeter groups

Abstract

Affine Coxeter groups are fundamental objects in mathematics and in crystallography. If two group elements are conjugate, then they have very similar algebraic and geometric properties. Using recent structural results of Mili\'cevi\'c, Schwer and the second author, we develop an app to visualize conjugation in affine Coxeter groups in dimensions 2 and 3. We explain the mathematics underlying this visualization, and connect its visual features to the arts.

Explore related subjects

Keep this discovery

BibTeXRIS

Amy Herron, Anne Thomas. 2026-05-28. Visualizing conjugation in affine Coxeter groups. https://arxiv.org/abs/2605.29337

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