Related papers: Metabelian Wreath Products Are LERF

We characterise the group property of being with infinite conjugacy classes for wreath products of groups

Given a finite group $H$ and a free group $F_n$, we prove that the wreath product $H\wr F_n$ admits a metrically proper, isometric action on a Hilbert space.

We prove that the set of subgroups of the automorphism group of a two-sided full shift is closed under countable graph products. We introduce the notion of a group action without $A$-cancellation (for an abelian group $A$), and show that…

Wreath products such as Z wr Z are not finitely-presentable yet can occur as subgroups of finitely presented groups. Here we compute the distortion of Z wr Z as a subgroup of Thompson's group F and as a subgroup of Baumslag's metabelian…

A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…

We show that amenability, the Haagerup property, the Kazhdan's property (T) and exactness are preserved under taking second nilpotent product of groups. We also define the restricted second nilpotent wreath product of groups, this is a…

We prove that a wreath product of an abelian group and a non-amenable group is not strongly Ulam stable. Previously this was known for groups containing free subgroups, due to work of Burger, Ozawa and Thom, and for some surface groups, due…

We define and study a notion of free wreath product with amalgamation for compact quantum groups. These objects were already introduced in the case of duals of discrete groups under the name "free wreath products of pairs" in a previous…

The group property FW stands in-between the celebrated Kazdhan's property (T) and Serre's property FA. Among many characterizations, it might be defined, for finitely generated groups, as having all Schreier graphs one-ended. It follows…

Let $(G_n,X_n)$ be a sequence of finite transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated permutational wreath product $...\wr G_2\wr G_1$ is topologically finitely generated if…

We study the Hopf property for wreath products of finitely generated groups, focusing on the case of an abelian base group. Our main result establishes a strong connection between this problem and Kaplansky's stable finiteness conjecture.…

In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under…

Let $A$ be a nilpotent $p$-group of finite exponent, and $B$ be an abelian $p$-groups of finite exponent. Then the wreath product $A {\rm Wr} B$ generates the variety ${\rm var}(A) {\rm var}(B)$ if and only if the group $B$ contains a…

In this paper we prove that the Diophantine problem in iterated restricted wreath products $G$ of arbitrary non-trivial free abelian groups $A_1,\ldots, A_k$, $k>1$ of finite ranks is undecidable, i.e., there is no algorithm that given a…

In this paper, we show that wreath products of groups have linear divergence, and we generalise the argument to permutational wreath products. We also prove that Houghton groups $\mathcal{H}_m$ with $m\geq 2$ and Baumslag-Solitar groups…

Let $K$ be field of characteristic 2 and let $G$ be a finite non-abelian 2-group with the cyclic derived subgroup $G'$, and there exists a central element $z$ of order 2 in $Z(G) \backslash G'$. We prove that the unit group of the group…

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…

A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so…

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…

A wreath product is a method to construct an association scheme from two association schemes. We determine the automorphism group of a wreath product. We show a known result that a wreath product is Schurian if and only if both components…