Search arXivSearch

arXiv · 2208.13691

Free polynilpotent groups and the Magnus property

Abstract

Motivated by a classic result for free groups, one says that a group $G$ has the Magnus property if the following holds: whenever two elements generate the same normal subgroup of $G$, they are conjugate or inverse-conjugate in $G$. It is a natural problem to find out which relatively free groups display the Magnus property. We prove that a free polynilpotent group of any given class row has the Magnus property if and only if it is nilpotent of class at most $2$. For this purpose we explore the Magnus property more generally in soluble groups, and we produce new techniques, both for establishing and for disproving the property. We also prove that a free centre-by-(polynilpotent of given class row) group has the Magnus property if and only if it is nilpotent of class at most $2$. On the way, we display $2$-generated nilpotent groups (with non-trivial torsion) of any prescribed nilpotency class with the Magnus property. Similar examples of finitely generated, torsion-free nilpotent groups are hard to come by, but we construct a $4$-generated, torsion-free, class-$3$ nilpotent group of Hirsch length $9$ with the Magnus property. Furthermore, using a weak variant of the Magnus property and an ultraproduct construction, we establish the existence of metabelian, torsion-free, nilpotent groups of any prescribed nilpotency class with the Magnus property.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Klopsch, Luis Mendonça, Jan Moritz Petschick. 2022-11-10. Free polynilpotent groups and the Magnus property. https://arxiv.org/abs/2208.13691

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Measures on Wreath Products II

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients: the $w$-expectations $E_w[χ]$ of the irreducible characters of $G$. For every finite group $G$, every stable character $χ$ of $G\wr S_n$ (trace of a finitely generated $FI_G$-module), and every word $w\in F_r$, we approximate $E_w[χ]$ up to an error term of $O(n^{-π(w)})$, where $π(w)$ is the primitivity rank of $w$. This generalizes previous works by Puder, Hanany, Magee and the author. As an application we show that random Schreier graphs of representation-stable actions of $G\wr S_n$ are close-to-optimal expanders. The paper reveals a surprising relation between stable representation theory of wreath products and not-necessarily connected Stallings core graphs.

math.GR

Robust quasi-isometric embeddings inapproximable by Anosov representations

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. For all but finitely many $m\in \mathbb{N}$, we exhibit the first examples of non-locally rigid, Zariski dense, robust quasi-isometric embeddings of hyperbolic groups in $\mathsf{SL}_m(\mathbb{K})$ which are not limits of Anosov representations. As a consequence, we show that higher rank analogues of Sullivan's structural stabilty theorem and of the density theorem for Kleinian groups fail for Anosov representations in $\mathsf{SL}_m(\mathbb{C}), m\geq 30$.

math.GR

$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove that the Grigorchuk group is 2-hereditarily conjugacy separable. As an application, we demonstrate that the lamplighter groups and $\mathbb{Z} \wr \mathbb{Z}$ are hereditarily conjugacy separable (but not $p$-conjugacy separable for any prime $p$). This provides infinitely many new examples of solvable, non-polycyclic hereditarily conjugacy separable groups. Furthermore, we study wreath products of cyclic subgroup separable groups and the derived length of iterated wreath products of solvable groups with an abelian base group and, as an application, we give an explicit construction of non-polycyclic hereditarily conjugacy separable groups of arbitrary derived length as iterated wreath products of abelian groups.

math.GR