A new lower bound for the number of conjugacy classes

Abstract

In 2003, H\'ethelyi and K\"ulshammer proposed that if G is a finite group and p is a prime dividing the group order, then k(G)≥ 2p-1, and they proved this conjecture for solvable G and showed that it is sharp for those primes p for which 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 arbitrary groups.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…