On graphic arrangement groups

From MaRDI portal
Publication:6323974

DOI10.1016/J.AAM.2020.102130arXiv1908.07664MaRDI QIDQ6323974FDOQ6323974


Authors: Daniel C. Cohen, Michael Falk Edit this on Wikidata


Publication date: 20 August 2019

Abstract: A finite simple graph Gamma determines a quotient PGamma of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior joint work with R. Randell. We show that, for a K4-free graph Gamma, a product of deletion maps is injective, embedding PGamma in a product of free groups. Then PGamma is residually free, torsion-free, residually torsion-free nilpotent, and acts properly on a CAT(0) cube complex. We also show PGamma is of homological finiteness type Fm1, but not Fm, where m is the number of copies of K3 in Gamma, except in trivial cases. The embedding result is extended to graphs whose 4-cliques share at most one edge, giving an injection of PGamma into the product of pure braid groups corresponding to maximal cliques of Gamma. We give examples showing that this map may inject in more general circumstances. We define the graphic braid group BGamma as a natural extension of PGamma by the automorphism group of Gamma, and extend our homological finiteness result to these groups.













This page was built for publication: On graphic arrangement groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6323974)