SearcharxivSearch

arXiv · 2304.10522

On the pseudovariety of groups $\mathbf{U} = \displaystyle\bigvee_{p \in \mathbb{P}} {\bf Ab}(p) \ast {\bf Ab}(p-1)$

Abstract

We introduce the pseudovariety of finite groups $\mathbf{U} = \displaystyle\bigvee_{p \in \mathbb{P}} {\bf Ab}(p) \ast {\bf Ab}(p-1)$, where $\mathbb{P}$ is the set of all primes. We show that $\mathbf{U}$ consists of all finite supersolvable groups with elementary abelian derived subgroup and abelian Sylow subgroups, being therefore decidable. We prove that it is decidable whether or not a finitely generated subgroup of a free group is closed or dense for the pro-${\bf U}$ topology. We consider also the pseudovariety of finite groups ${\bf Ab}(p) \ast {\bf Ab}(d)$ (where $p$ is a prime and $d$ divides $p-1$). We study the pro-$({\bf Ab}(p) \ast {\bf Ab}(d))$ topology on a free group and construct the unique generator of minimum size of the pseudovariety ${\bf Ab}(p) \ast {\bf Ab}(d)$. Finally, we prove that the variety of groups generated by ${\bf U}$ is the variety of all metabelian groups, obtaining also results on the varieties generated by a Baumslag-Solitar group of the form $BS(1,q)$ for $q$ prime.

Explore related subjects

Keep this discovery

BibTeXRIS

Claude Marion, Pedro V. Silva, Gareth Tracey. 2023-04-20. On the pseudovariety of groups $\mathbf{U} = \displaystyle\bigvee_{p \in \mathbb{P}} {\bf Ab}(p) \ast {\bf Ab}(p-1)$. https://arxiv.org/abs/2304.10522

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