The linear conjugacy-class bound for finite groups

Let GG be a finite group, let k(G)k(G) denote its number of conjugacy classes, and let G|G| denote its order. Linear conjugacy-class bound. There exists a constant C>0C>0 such that, for every finite group GG,

k(G)Clog2G.k(G)\geq C\log_2|G|.

This conjecture asks for a universal logarithmic lower bound on the number of conjugacy classes in terms of the group order. It is presented as a central open problem motivating the paper's sharper result for alternating groups.

Sources & referencesView supporting material

Primary source

Xandru Mifsud, “A lower-bound for the number of conjugacy classes of A_n”, arXiv:2310.12047 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.