SearcharxivSearch

arXiv · 1707.08353

Elementary equivalence in Artin groups of finite type

Abstract

Irreducible Artin groups of finite type can be parametrized via their associated Coxeter diagrams into six sporadic examples and four infinite families, each of which is further parametrized by the natural numbers. Within each of these four infinite families, we investigate the relationship between elementary equivalence and isomorphism. For three out of the four families, we show that two groups in the same family are equivalent if and only if they are isomorphic; a positive, but weaker, result is also attained for the fourth family. In particular, we show that two braid groups are elementarily equivalent if and only if they are isomorphic. As a consequence of our work, we prove that there are infinitely many elementary equivalence classes of irreducible Artin groups of finite type. We also show that mapping class groups of closed surfaces - a geometric analogue of braid groups - are elementarily equivalent if and only if they are isomorphic.

Explore related subjects

Keep this discovery

BibTeXRIS

Arpan Kabiraj, T. V. H. Prathamesh, Rishi Vyas. 2018-04-11. Elementary equivalence in Artin groups of finite type. https://doi.org/10.1142/s0218196718500157

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