Answers are grounded in this paper and cite their sources.
Let [Formula: see text] be a finite group. For an irreducible character [Formula: see text] of [Formula: see text], define its codegree by [Formula: see text]. Many authors have investigated the [Formula: see text]-prime hypothesis, where [Formula: see text], on the character degree set, the set of conjugacy class sizes and the set of orders of vanishing elements of a finite group. We consider the three-prime hypothesis on the codegree set. Specifically, we classify finite groups with a trivial solvable radical that satisfy the three-prime hypothesis on their codegree sets. We then show that if [Formula: see text] is nonsolvable, then no prime divides three distinct elements of its codegree set if and only if [Formula: see text], [Formula: see text]. This offers a codegree analogue of the results of D. Benjamin, M.L. Lewis and D.L. White.
No takes yet. Share an insight, caveat, or question.
Mabena et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: