arXiv Analytics

Sign in

arXiv:2310.09459 [math.GR]AbstractReferencesReviewsResources

A new lower bound for the number of conjugacy classes

Burcu Çınarcı, Thomas Michael Keller

Published 2023-10-14Version 1

In 2003, H\'{e}thelyi and K\"{u}lshammer proposed that if $G$ is a finite group and $p$ is a prime dividing the group order, then $k(G)\geq 2\sqrt{p-1}$, and they proved this conjecture for solvable $G$ and showed that it is sharp for those primes $p$ for which $\sqrt{p-1}$ is an integer. This initiated a flurry of activity, leading to many generalizations and variations of the result; in particular, today the conjecture is known to be true for all finite groups. In this note, we put forward a natural new and stronger conjecture, which is sharp for all primes $p$, and we prove it for solvable groups, and when $p$ is large, also for $p$-solvable groups.

Related articles: Most relevant | Search more
arXiv:1411.0454 [math.GR] (Published 2014-11-03)
A lower bound for the number of conjugacy classes of a finite group
arXiv:0812.2590 [math.GR] (Published 2008-12-13)
Finite groups have even more conjugacy classes
arXiv:1503.04046 [math.GR] (Published 2015-03-13)
Finite groups have more conjugacy classes