SearcharxivSearch

arXiv · 1607.02464

A Classification Theorem for Varieties Generated by Wreath Products of Groups

Abstract

We suggest a criterion under which for a nilpotent group of finite exponent $A$ and for an abelian group $B$ the variety $var(A \,Wr\, B)$ generated by their wreath product $A \,Wr\, B$ is equal to the product of varieties $var(A)$ and $var(B)$ generated by $A$ and $B$. Namely the equality holds if and only if either the group $B$ is not of some non-zero exponent; or if $B$ is of a non-zero exponent $n$, and $B$ contains a subgroup isomorphic to $C_{d}^c \times C_{n/d}^\infty$, where $c$ is the nilpotency class of $A$, $d$ is the largest divisor of $n$ coprime with $m$, $C_{d}^c$ is the direct power of $c$ copies of the cycle $C_d$ of order $d$, $C_{n/d}^\infty$ is the direct power of countably many copies of the cycle $C_{n/d}$ of order $n/d$. This criterion continues our previous work on cases when the similar criterions were given for wreath products of abelian groups or of finite groups. Also, this is a generalization of known results in literature, which solve the same problem for much more restricted cases. Some applications of the criterion are considered at the end of paper.

Explore related subjects

Keep this discovery

BibTeXRIS

Vahagn H. Mikaelian. 2016-07-08. A Classification Theorem for Varieties Generated by Wreath Products of Groups. https://arxiv.org/abs/1607.02464

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR