2000 character limit reached
CAT(0) cubical complexes for graph products of finitely generated abelian groups
Published 31 Oct 2013 in math.GR and math.GT | (1310.8646v2)
Abstract: We show that every graph product of finitely generated abelian groups acts properly and cocompactly on a CAT(0) cubical complex. The complex generalizes (up to subdivision) the Salvetti complex of a right-angled Artin group and the Coxeter complex of a right-angled Coxeter group. In the right-angled Artin group case it is related to the embedding into a right-angled Coxeter group described by Davis and Januszkiewicz. We compare the approaches and also adapt the argument that the action extends to finite index supergroup that is a graph product of finite groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.