SearcharxivSearch

arXiv · 1501.03170

On the characterization of the numbers $n$ such that any group of order $n$ has a given property $P$

Abstract

One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of solvable groups, both of which will be invaluable in our analysis. We then gather various solutions to this problem for cyclic, abelian, nilpotent, and supersolvable groups, as well as groups with ordered Sylow towers. This work is an exposition of known results, but it is hoped that the reader will find useful the presentation in a single account of the various tools that have been used to solve this general problem. This article claims no originality, but is meant as a synthesis of related knowledge and resources.

Explore related subjects

Keep this discovery

BibTeXRIS

Logan Crew. 2015-01-06. On the characterization of the numbers $n$ such that any group of order $n$ has a given property $P$. https://arxiv.org/abs/1501.03170

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