Pith. sign in

REVIEW 1 major objections 20 references

On prime divisors of character degrees and codegrees

T0 review · 1 major / 0 minor · reviewed 2026-06-26 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read If a finite group has at most three distinct primes dividing its character degrees or codegrees, then the group is solvable.

desk verdict This extends degree-based solvability criteria to include codegrees with a bound of three distinct prime sets. read the letter →

arxiv 2606.27065 v1 pith:CXONLSX3 submitted 2026-06-25 math.GR

Dongfang Yang This is my paper · ORCID
classification math.GR
keywords finitegroupscharacterdegreescodegreessolvabilityprimedivisorsirreduciblecharacters
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper studies the sets of prime divisors that appear among the degrees of irreducible characters and among the codegrees of those characters. It shows that whenever either of these two sets contains three or fewer primes, the underlying finite group must be solvable. The same conclusion is reached for both the degree and codegree versions, and a further generalization is given for the degree version. This supplies a new numerical criterion that forces solvability by limiting the primes that can divide the character data.

What carries the argument

ω_ε(G), the set of all distinct primes that divide at least one number in the collection of degrees or codegrees of irreducible characters of G.

What would settle it

A single counter-example: any non-solvable finite group in which the primes dividing its character degrees number at most three.

Watch

Extended reading notes

Core claim

Let G be a finite group. Define cd_+(G) as the set of ordinary character degrees and cd_-(G) as the set of codegrees. Let ω_ε(G) be the union of the prime divisors of all numbers in cd_ε(G). The paper proves that |ω_ε(G)| ≤ 3 implies G is solvable, for both choices of ε, together with a generalization of the result when ε = +.

Load-bearing premise

The definitions of character degrees, codegrees, and the primes dividing them apply without extra restrictions to every finite group.

Editorial extensions

If this is right

  • Any finite group whose character degrees involve at most three primes must be solvable.
  • The same solvability conclusion holds when the restriction is placed on the codegrees instead of the degrees.
  • A generalization of the degree result exists beyond the basic bound of three primes.
  • Non-solvable groups necessarily require at least four distinct primes among their degrees or among their codegrees.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The result supplies a quick numerical test that can rule out non-solvability for groups whose character tables are already computed.
  • It may be useful to check whether the bound of three can be lowered for certain families of groups, such as those of odd order.
  • The argument likely relies on the fact that non-solvable groups contain simple non-abelian composition factors, each of which forces additional primes into the degree or codegree sets.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

1 major / 0 minor

Summary. The manuscript defines cd_ε(G) as the set of ε-degrees (ordinary degrees χ(1) for ε=+, codegrees |G:ker(χ)|/χ(1) for ε=-) of irreducible characters of a finite group G, and ω_ε(G) as the collection of distinct prime-divisor sets π(n) for n in cd_ε(G). It claims to prove that |ω_ε(G)| ≤ 3 implies G is solvable, together with a generalization of the result in the case ε=+.

Significance. If established, the result would supply a solvability criterion phrased in terms of the number of distinct prime sets appearing among character degrees or codegrees. Such a criterion would sit alongside existing degree-based solvability theorems and could be useful for groups whose degree sets are restricted in their prime factors.

major comments (1)
  1. [Abstract] Abstract: the claim that |ω_ε(G)| ≤ 3 implies solvability of G is stated without any proof, derivation steps, or supporting data; the central claim cannot be checked against any visible mathematics or evidence.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their report. We address the single major comment below. The full manuscript contains the proofs of the stated results; the abstract follows standard conventions by summarizing the main theorems.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim that |ω_ε(G)| ≤ 3 implies solvability of G is stated without any proof, derivation steps, or supporting data; the central claim cannot be checked against any visible mathematics or evidence.

    Authors: Abstracts are intended to state the principal results of a paper concisely and do not include proofs or derivations; those appear in the body of the manuscript (Sections 2–4 contain the complete arguments). The referee’s observation is correct in a literal sense but does not indicate a deficiency in the paper. If only the abstract was available, the full text on arXiv:2606.27065 supplies the required mathematics. No revision to the abstract is required. revision: no

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; result is a direct theorem

full rationale

The paper states a theorem establishing that |ω_ε(G)| ≤ 3 implies G solvable, using the explicitly defined cd_ε(G) and ω_ε(G) from standard Irr(G) and prime sets π(n). No equations, fitted parameters, self-citations, or ansatzes are shown that reduce the implication to its own inputs by construction. The derivation chain is a standard group-theoretic proof relying on external definitions, with no load-bearing self-reference or renaming of known results visible.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

The result rests on standard background facts from finite group representation theory; no free parameters or invented entities appear in the abstract.

assumptions (2)
  • standard math Every finite group possesses a complete set of irreducible complex characters.
    Foundational fact of character theory invoked by the definitions of cd_ε(G).
  • domain assumption The codegree is given by |G:ker(χ)| / χ(1) for each irreducible character χ.
    Explicit definition supplied in the abstract for ε = −.

how reviews work

0 comments
Cite this review

Pith. "Pith review of On prime divisors of character degrees and codegrees." pith.science (2026). https://pith.science/paper/CXONLSX3

@misc{pith2026260627065,
  author       = {Pith},
  title        = {Pith review of: On prime divisors of character degrees and codegrees},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CXONLSX3}},
  note         = {Machine review of arXiv:2606.27065}
}
abstract

Let $G$ be a finite group, and let $\mathrm{Irr}(G)$ denote the set of irreducible complex characters of $G$. For $\epsilon\in \{ \pm \}$, we define $\mathrm{cd}_{\epsilon}(G)=\{ \chi_{\epsilon}(1)\mid \chi\in \mathrm{Irr}(G) \}$, where $\chi_{+}(1)=\chi(1)$ denotes the degree of $\chi$, $\chi_{-}(1)=|G:\ker(\chi)|/\chi(1)$ denotes the codegree of $\chi$. Further, let $\omega_{\epsilon}(G)=\{ \pi(n)\mid n\in \mathrm{cd}_{\epsilon}(G) \}$, where $\pi(n)$ stands for the set of prime divisors of $n$. We established that if $|\omega_{\epsilon}(G)|\leq 3$, then $G$ is solvable. Additionally, a generalization of this result is obtained in the case when $\epsilon=+$.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 1 canonical work pages

  1. [1]

    Alizadeh, H

    F. Alizadeh, H. Behravesh, M. Ghaffarzadeh, M. Ghasemi and S. Hekmatara, Groups with few codegrees of irreducible characters, Comm. Algebra 47(3) (2019), 1147--1152

    2019

  2. [2]

    Du and M

    N. Du and M. Lewis, Codegrees and nilpotence class of p -groups, J. Group Theory 19(4) (2019), 561--568

    2019

  3. [3]

    Everest and W

    G. Everest and W. Thomas, An introduction to number theory , Graduate Texts of Mathematics, vol. 232, Springer-Verlag London, London, 2005

    2005

  4. [4]

    Fulton and J

    W. Fulton and J. Harris, Representation theory: a first course , Graduate Texts of Mathematics, vol. 129, Springer Science + Business Media, 2004

    2004

  5. [5]

    The GAP Group, GAP - Groups, Algorithms, and Programming, Version 4.13.1, 2024, http://www.gap-system.org http://www.gap-system.org

    2024

  6. [6]

    Gorenstein, Finite simple groups: an introduction to their classification, Springer Science+Business Media, New York, 1982

    D. Gorenstein, Finite simple groups: an introduction to their classification, Springer Science+Business Media, New York, 1982

    1982

  7. [7]

    Granville and K

    A. Granville and K. Ono, Defect zero p -blocks for finite simple groups, Trans. Amer. Math. Soc. 348(1) (1996), 331--347

    1996

  8. [8]

    Huppert, Endliche Gruppen I, Springer-Verlag, Berlin, 1967

    B. Huppert, Endliche Gruppen I, Springer-Verlag, Berlin, 1967

    1967

Show all 20 references
  1. [9]

    Isaacs, Groups having at most three irreducible character degrees, Proc

    I.M. Isaacs, Groups having at most three irreducible character degrees, Proc. Amer. Math. Soc. 21(1) (1969), 185--188

    1969

  2. [10]

    Isaacs, Character Theory of Finite Groups , Dover, New York, 1994

    I.M. Isaacs, Character Theory of Finite Groups , Dover, New York, 1994

    1994

  3. [11]

    Isaacs and G

    I.M. Isaacs and G. Knutson, Irreducible character degrees and normal subgroups, J. Algebra 199(1) (1998), 302--326

    1998

  4. [12]

    Isaacs and D.S

    I.M. Isaacs and D.S. Passman, A characterization of groups in terms of the degrees of their characters, Pacific J. Math. 15 (1965), 877--903

    1965

  5. [13]

    Isaacs and D.S

    I.M. Isaacs and D.S. Passman, A characterization of groups in terms of the degrees of their characters II, Pacific J. Math. 24 (1968), 467--510

    1968

  6. [14]

    Liang and G

    D. Liang and G. Qian, Finite groups with coprime character degrees and codegrees, J. Group Theory 19(5) (2016), 763--776

    2016

  7. [15]

    Michler, A finite simple Lie group has p -blocks with different defects, p 2 , J

    G. Michler, A finite simple Lie group has p -blocks with different defects, p 2 , J. Algebra 104(2) (1986), 220--230

    1986

  8. [16]

    G. Qian, Y. Wang and H. Wei, Co-degrees of irreducible characters in finite groups, J. Algebra 312 (2) (2007), 946--955

    2007

  9. [17]

    Riese and P

    U. Riese and P. Schmid, Characters Induced from Sylow Subgroups, J. Algebra 207 (1998), 682--694

    1998

  10. [18]

    White, Degree graphs of simple groups, Rocky Mt

    D.L. White, Degree graphs of simple groups, Rocky Mt. J. Math. 39(5) (2009), 3641--3649

    2009

  11. [19]

    White, Character degrees of extensions of PSL_2(q) and SL_2(q) , J

    D.L. White, Character degrees of extensions of PSL_2(q) and SL_2(q) , J. Group Theory 16(1) (2013), 1--33

    2013

  12. [20]

    Y. Zeng, M. Ghaffarzadeh, M. Ghasemi and D. Yang, Finite groups of non-prime-power order with exactly four character codegrees, https://arxiv.org/pdf/2510.08221 https://arxiv.org/pdf/2510.08221

Pith tools

Reviewed June 26, 2026 · model on record in the stance chip above.