SearcharxivSearch

arXiv · 2406.11199

More on Landau's theorem and Conjugacy Classes

Abstract

In this paper we present two new results on the number of certain conjugacy classes of a finite group. For a finite group $G$, let $n(G)$ be the maximum of $k_{p}(G)$ taken over all primes $p$ where $k_{p}(G)$ denotes the number of conjugacy classes of nontrivial $p$-elements in $G$. Using a recent theorem of Giudici, Morgan and Praeger, we prove that there exists a function $f(x)$ with $f(x) \to \infty$ as $x \to \infty$ such that $n(G) \geq f(|G|)$ for any finite group $G$. Let $G$ be a finite group, and let $p$ be a prime dividing $|G|$. Let $k_{p'}(G)$ denote the number of conjugacy classes of elements of $G$ whose orders are coprime to $p$. We show that either $p=11$ and $G=C_{11}^2\rtimes \text{\rm SL}(2,5)$, or there exists a factorization $p-1 = ab$ with $a$ and $b$ positive integers, such that $k_{p}(G) \geq a$ and $k_{p'}(G) \geq b$ with equalities in both cases if and only if $G=C_p \rtimes C_b$ with $C_G(C_p) = C_p$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Burcu Çınarcı, Thomas Michael Keller, Attila Maróti, Iulian I. Simion. 2024-06-17. More on Landau's theorem and Conjugacy Classes. https://arxiv.org/abs/2406.11199

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