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 be a finite simplicial graph with all edges labelled by positive even integers and A be its associated Artin group; our new proof implies that if AT is poly-free (resp. normally poly-free) for every clique T in , then A 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 is an even Artin group such that each clique in 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 satisfies the Farrell--Jones Conjecture. In addition, our methods enables us to obtain results for general Artin groups.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…