SearcharxivSearch

arXiv · 2309.11113

Groups with at most 13 nonpower subgroups

Abstract

For a group G and positive interger m, Gm denotes the subgroup generated by the elements gm where g runs through G. The subgroups not of the form Gm are called nonpower subgroups. We extend the classification of groups with few nonpower subgroups from groups with at most 9 nonpower subgroups to groups with at most 13 nonpower subgroups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiwei Zheng, Wei Zhou, D. E. Taylor. 2023-09-20. Groups with at most 13 nonpower subgroups. https://doi.org/10.1017/s0004972725100750

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