SearcharxivSearch

arXiv · 2606.23907

New variations on the theme of Baer's theorem

Abstract

Let $\gamma_s(G)$ and $Z_s(G)$ denote the $s$-th terms of the lower and upper central series of a group $G$, respectively. A classical theorem by R. Baer states that if $Z_s(G)$ has finite index $n$ in $G$, then $\gamma_{s+1}(G)$ is also finite. In this paper, we prove that if $G$ is a generalized soluble group such that the quotient $\gamma_s(G)/(\gamma_s(G) \cap Z_t(G))$ has finite rank $r$ for some $s,t$, then the rank of $\gamma_{s+t}(G)$ is finite and $(r,s,t)$-bounded. Moreover, a corresponding result replacing the finite-rank assumption by the condition to be a Chernikov group of bounded size is also obtained. These results extend recent generalizations of the classical Baer's theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Martina Capasso, Liliana Lancellotti, Pavel Shumyatsky. 2026-06-22. New variations on the theme of Baer's theorem. https://arxiv.org/abs/2606.23907

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