SearcharxivSearch

arXiv · 1912.04350

Poly-freeness of Artin groups and the Farrell-Jones Conjecture

Abstract

We provide two simple proofs of the fact that even Artin groups of FC-type are poly-free which was recently established by R. Blasco-Garcia, C. Mart\'inez-P\'erez and L. Paris. More generally, let $\Gamma$ be a finite simplicial graph with all edges labelled by positive even integers and $A_\Gamma$ be its associated Artin group; our new proof implies that if $A_T$ is poly-free (resp. normally poly-free) for every clique $T$ in $\Gamma$, then $A_\Gamma$ is poly-free (resp. normally poly-free). We prove similar results regarding the Farrell--Jones Conjecture for even Artin groups. In particular, we show that if $A_\Gamma$ is an even Artin group such that each clique in $\Gamma$ either has at most 3 vertices, has all of its labels at least $6$, or is the join of these two types of cliques (the edges connecting the cliques are all labelled by $2$), then $A_\Gamma$ satisfies the Farrell--Jones Conjecture. In addition, our methods enables us to obtain results for general Artin groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiaolei Wu. 2019-12-09. Poly-freeness of Artin groups and the Farrell-Jones Conjecture. https://arxiv.org/abs/1912.04350

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