2000 character limit reached
    
  Graph-wreath products and finiteness conditions (1407.0302v5)
    Published 1 Jul 2014 in math.GR
  
  Abstract: A notion of \emph{graph-wreath product} is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type $\operatorname{F}_n$. Under various additional assumptions we show that these conditions are necessary. Our results generalise results of Cornulier about wreath products in case $n=2$. Graph-wreath products include classical permutational wreath products and semidirect products of right-angled Artin groups by groups of automorphisms amongst others.
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.