SearcharxivSearch

arXiv · 2010.09178

Hamiltonian Groups with Perfect Order Classes

Abstract

A finite group is said to have "perfect order classes" if the number of elements of any given order is either zero or a divisor of the order of the group. The purpose of this note is to describe explicitly the finite Hamiltonian groups with perfect order classes. We show that a finite Hamiltonian group has perfect order classes if, and only if, it is isomorphic to the direct product of the quaternion group of order $8$, a non-trivial cyclic $3$-group and a group of order at most $2$. Theorem. A finite Hamiltonian group has perfect order classes if, and only if, it is isomorphic either to $Q\times C_{3^k}$ or to $Q\times C_{2}\times C_{3^k}$, for some positive integer $k$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

James McCarron. 2021-05-05. Hamiltonian Groups with Perfect Order Classes. https://doi.org/10.3318/pria.2021.121.01

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