SearcharxivSearch

arXiv · math/0509376

Finite groups with conjugacy classes number one greater than its same order classes number

Abstract

Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $π_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|π_e(G)|+k$. We call such groups to be $co(k)$ groups. This paper classifies all finite $co(1)$ groups. They are isomorphic to one of the following groups: $A_5, L_2(7), S_5, Z_3, Z_4, S_4, A_4$, $D_{10}, Hol(Z_5)$, or $Z_3\rtimes Z_4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xianglin Du, Wujie Shi. 2005-09-16. Finite groups with conjugacy classes number one greater than its same order classes number. https://arxiv.org/abs/math/0509376

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