SearcharxivSearch

arXiv · 1812.00222

A note on abelian subgroups of maximal order

Abstract

In a recent paper of the first author and I. M. Isaacs it was shown that if m = m(G) is the maximal order of an abelian subgroup of the finite group G, then |G| divides m! ([AI18, Thm. 5.2]). The purpose of this brief note is to improve on the m! bound (see Theorem 2.1 below). We shall then take up the task of determining when the (implicit) inequality of our theorem becomes an equality. Despite, perhaps, first appearances this determination is not trivial. To accomplish it we shall establish a result (Theorem 2.3) of independent interest and we shall then see that Theorems 2.1 and 2.3 combine to further strengthen Theorem 2.1 (see Theorem 3.4).

Explore related subjects

Keep this discovery

BibTeXRIS

Stefanos Aivazidis, Robert M. Guralnick. 2018-12-01. A note on abelian subgroups of maximal order. https://doi.org/10.4171/rlm%2F893

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