SearcharxivSearch

arXiv · 2001.11106

The order of the product of two elements in finite nilpotent groups

Abstract

An old problem in group theory is that of describing how the order of an element behaves under multiplication. To generalize some classical bounds concerning the order $\mathrm o(ab)$ of two elements $a, b$ in a finite abelian group to the non-commutative case, we replace $\mathrm o(ab)$ with a notion of mutual order $\mathrm o(a, b)$, defined as the least positive integer $n$ such that $a^nb^n = 1$. Motivated by this, we then compare $\mathrm o(ab)$ and $\mathrm o(a, b)$ in finite nilpotent groups, and show that in a group of class $\gamma$, the ratio $\mathrm o(ab)/\mathrm o(a, b)$ lies in some fixed finite set $S(\gamma) \subset \mathbb Q$, whose elements do not involve prime factors exceeding $\gamma$. In particular, we generalize a result of P. Hall, which asserts that $\mathrm o(ab) = \mathrm o(a, b)$ in $p$-groups with $p > \gamma$. We end with a more detailed analysis for groups of class 2, which allows one to give a more explicit description of $\mathrm o(ab)/\mathrm o(a, b)$.

Explore related subjects

Keep this discovery

BibTeXRIS

C. M. Bonciocat. 2020-01-29. The order of the product of two elements in finite nilpotent groups. https://arxiv.org/abs/2001.11106

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