SearcharxivSearch

arXiv · 2301.04211

Random Artin groups

Abstract

We introduce a new model of random Artin groups. The two variables we consider are the rank of the Artin groups and the set of permitted coefficients of their defining graphs. The heart of our model is to control the speed at which we make that set of permitted coefficients grow relatively to the growth of the rank of the groups, as it turns out different speeds yield very different results. We describe these speeds by means of (often polynomial) functions. In this model, we show that for a large range of such functions, a random Artin group satisfies most conjectures about Artin groups asymptotically almost surely. Our work also serves as a study of how restrictive the commonly studied families of Artin groups are, as we compute explicitly the probability that a random Artin group belongs to various families of Artin groups, such as the classes of $2$-dimensional Artin groups, $FC$-type Artin groups, large-type Artin groups, and others.

Explore related subjects

Keep this discovery

BibTeXRIS

Antoine Goldsborough, Nicolas Vaskou. 2023-01-10. Random Artin groups. https://doi.org/10.2140/agt.2025.25.1523

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