SearcharxivSearch

arXiv · 2402.13247

On a bijection between a finite group to a non-cyclic group with divisibility of element orders

Abstract

Consider a finite group $G$ of order $n$ with a prime divisor $p$. In this article, we establish, among other results, that if the Sylow $p$-subgroup of $G$ is neither cyclic nor generalized quaternion, then there exists a bijection $f$ from $G$ onto the abelian group $C_{\frac{n}{p}}\times C_p$ such that for every element $x$ in $G$, the order of $x$ divides the order of $f(x)$. This resolves Question 1.5 posed in [15]. As application of our results, we show that the group with the third largest value of the sum of element orders in the set of all finite groups of order $n$ is a solvable $p$-nilpotent group where $p$ is the smallest prime divisor of $n$ such that the Sylow $p$-subgroups are not cyclic.

Explore related subjects

Keep this discovery

BibTeXRIS

Mohsen Amiri. 2024-02-20. On a bijection between a finite group to a non-cyclic group with divisibility of element orders. https://arxiv.org/abs/2402.13247

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