Cinarcı–Keller conjecture on the minimum number of conjugacy classes

About 2 years old · traced to

Let pp be a prime. Let aa and bb be positive integers such that

p−1=abp-1=ab

and such that ∣a−b∣|a-b| is minimal. For a finite group GG, let k(G)k(G) denote the number of conjugacy classes of GG. Cinarcı–Keller conjecture. If pp divides ∣G∣|G|, then

k(G)≥a+b,k(G)\geq a+b,

and equality holds if and only if

G≅Cp⋊CaorG≅Cp⋊Cb.G\cong \mathsf{C}_p\rtimes\mathsf{C}_a\quad\text{or}\quad G\cong \mathsf{C}_p\rtimes\mathsf{C}_b.

Here the two semidirect products are the groups occurring in the source's equality characterization. The conjecture is presented as an open problem; the paper notes that its lower bound is supported by the authors' main theorem in cases where the relevant integer belongs to the specified divisor set.

References

Primary source

Attila Maróti, J. Miquel Martínez, A. A. Schaeffer Fry and Carolina Vallejo, “On almost p-rational characters in principal blocks”, arXiv:2401.09224 (2024).

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.