SearcharxivSearch

arXiv · 2509.01361

Conjugacy invariants and rigidity in Garside groups: a uniformity phenomenon

Abstract

Consider an element~$x$ of a Garside group which is rigid in the sense of Garside-theory. Let $SC(x)$ be the set of rigid conjugates of~$x$ -- this is a well-known characteristic subset of the conjugacy class of~$x$. We present computational evidence that the sequence $( |SC(x^n)| )_{n\in\mathbb N}$ is not only bounded, but in fact periodic, and that there is a bound on the length of the period which depends only on the underlying group and its Garside structure. We prove this result in the special case of the circular Garside groups, including the 2-generator Artin groups with their classical and dual structures (where we prove that the sequence is always constant), and in the case of the dual $4$-strand braid group.

Explore related subjects

Keep this discovery

BibTeXRIS

Matthieu Calvez, Owen Garnier, Juan González-Meneses, Bert Wiest. 2025-09-01. Conjugacy invariants and rigidity in Garside groups: a uniformity phenomenon. https://arxiv.org/abs/2509.01361

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