Graph-wreath products and finiteness conditions (Q886973): Difference between revisions

Given a simple graph \(\Gamma\) and a family of groups indexing the vertices of \(\Gamma\), the graph product is the quotient of the free product of the vertex groups by imposing commutator relations whenever two vertices are joined by an edge. Assuming all the vertices are indexed by the same group \(A\), and that the graph is acted upon by some group \(H\), the graph-wreath product is the semidirect product of the graph product \(A^\Gamma\) by \(H\). Such groups include classical permutational wreath products and semidirect products of right-angled Artin groups by certain automorphism groups. The authors study the finiteness properties F\({}_n\) and FP\({}_n\) of such products building on, and generalising, results from [\textit{Y. De Cornulier}, Geom. Dedic. 122, 89--108 (2006; Zbl 1137.20019)] and from [\textit{L. Bartholdi} et al., Q. J. Math. 66, No. 2, 437--457 (2015; Zbl 1371.20049)]. Their first theorem gives sufficent conditions for the wreath product to be of type F\({}_n\). They show that these conditions are necessary in case \(n=2\). The remaining theorems aim at finding necessary conditions for a product to be of type F\({}_n\) for any \(n\). They also discuss examples and applications. For instance, they show that for arbitrarily large \(n\), there exists an elementary amenable group of type F\({}_n\) which has a subgroup isomorphic to the \(n\)-fold iterated wreath product of infinite cyclic groups.