SearcharxivSearch

arXiv · 1501.03090

A generalization of 2-Baer groups

Abstract

A group in which all cyclic subgroups are 2-subnormal is called a 2-Baer group. The topic of this paper are generalized 2-Baer groups, i.e. groups in which the non-2-subnormal cyclic subgroups generate a proper subgroup of the group. If this subgroup is non-trivial, the group is called a generalized T_2-group. In particular, we provide structure results for such groups, investigate their nilpotency class and construct examples of finite p-groups which are generalized T_2-groups.

Explore related subjects

Keep this discovery

BibTeXRIS

L. -C. Kappe, A. Tortora. 2015-01-13. A generalization of 2-Baer groups. https://arxiv.org/abs/1501.03090

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