SearcharxivSearch

arXiv · 1010.3876

On minimal non-$CL$-groups

Abstract

If $m$ is a positive integer or infinity, the $m$-layer (or briefly, the layer) of a group $G$ is the subgroup $G_m$ generated by all elements of $G$ of order $m$. This notion goes back to some contributions of Ya.D. Polovickii of almost 60 years ago and is often investigated, because the presence of layers influences the group structure. If $G_m$ is finite for all $m$, $G$ is called $FL$-group (or $FO$-group). A generalization is given by $CL$-groups, that is, groups in which $G_m$ is a Chernikov group for all $m$. By working on the notion of $CL$-group instead of that of $FL$-group, we extend a recent result of Z. Zhang, describing the structure of a group which is not a $CL$-group, but whose proper subgroups are $CL$-groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniele Ettore Otera, Francesco G. Russo. 2010-10-19. On minimal non-$CL$-groups. https://doi.org/10.4399/97888548602475

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