{"id":"60b9750f-0b9f-45c0-87a8-a0e9516d7ce1","arxiv_id":"1908.06867","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper introduces the commuting graph of A-orbits and shows that several graph conditions, such as completeness or triangle-freeness, impose strong structural constraints on finite groups.","lead":"This paper defines a new graph, the commuting graph of A-orbits, whose vertices are orbits of a finite group action and whose edges mark when two orbits contain commuting elements. It proves that completeness of this graph forces the group to be nilpotent, and classifies the groups arising from disconnected, isolated-vertex, and triangle-free versions.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.2 Step (2) rests on an ambiguous paraphrase of [15]; if Cor 7.6(2) only concerns 2-complete vertices, the exclusion of simple groups fails.","rationale":"The reader's weakest assumption identifies the same point: reliance on [15]. I agree that this is the softest load-bearing premise. I checked other candidate weaknesses: the commutator step in Step (3) is terse but can be justified by coprime-action and Frattini arguments, and the reduction to G1 in Step (2) is valid. The genuinely unverified link is the translation from 'GK(G) complete' to the quoted dichotomy in [15]. If that translation is wrong, Theorem 3.2 and hence Theorem 3.3 lose their main contradiction. Since the reader's verdict was already CONDITIONAL, my stress test does not change it: the concern is a verification task, not a demonstrated falsehood.","tokens_in":10623,"tokens_out":38897,"duration_ms":394481,"concrete_test":"Obtain [15, Thm 7.1 and Cor 7.6(2)] and write out their exact hypotheses and conclusions. Then test the paper's use with A_27: list the primes dividing |A_27| and verify that 2 is adjacent to every other prime (for p ≤ 23, a p-cycle plus two transpositions lies in A_27) while 17 and 19 are nonadjacent (no element of order 17·19 exists since 17+19 > 27). If Cor 7.6(2) permits a 2-complete but not complete prime graph, the Step (2) contradiction must be rederived; if it explicitly rules out complete prime graphs and covers this configuration, the cited step is sound.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is Theorem 3.2. In its Step (2), after reducing the nonsolvable case to a nonabelian simple group G, the proof needs GK(G) to be impossible. The only argument is a citation: if 2 is complete in GK(G), [15, Thm 7.1] forces G = A_n with no prime in [n−3,n], and [15, Cor 7.6(2)] 'shows that there is no such simple group.' This is the sole step excluding nonabelian simple factors, so the theorem's correctness is contingent on the exact statements: Cor 7.6(2) must rule out complete prime graphs, not merely 2-complete vertices. The distinction matters: A_27 has 2 as a complete vertex of GK(A_27) (e.g. a 23-cycle together with two transpositions gives an element of order 46, and p+4 ≤ 27 for every prime p ≤ 23), while GK(A_27) is not complete since primes 17 and 19 are nonadjacent. Therefore if the paper's 'no such simple group' means 'no 2-complete simple group,' the application is false; if it means 'no complete prime graph,' an additional clarifying argument is needed. The paper does not restate the theorem or corollary, making this the most load-bearing unverified premise.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces the commuting graph Γ(G,A) of A-orbits on a finite group G, whose vertices are the nontrivial A-orbits and whose edges join two orbits when they contain commuting representatives. The main results are: Theorem 3.2, asserting that if every orbit of a p-element is adjacent to every orbit of a q-element for all distinct primes p and q, then G is nilpotent; Theorem 3.3, that completeness of Γ(G,A) implies nilpotency; Theorem 3.6, a solvability analogue based on solvable generation of pairs; Proposition 3.11, a structural conclusion for complete vertices; Theorem 4.2, classifying when an edgeless Γ(G,A) with more than one vertex occurs; and Theorem 5.2, characterizing triangle-free Γ(G,A) for nonsolvable G in terms of known CP-groups. The proofs reduce largely to cited classifications of Frobenius and 2-Frobenius groups, prime graphs of simple groups, CP-groups, and fixed-point-free automorphisms.","tokens_in":10878,"tokens_out":18467,"duration_ms":175701,"significance":"If the main theorems are correct, the paper offers a useful new invariant: the quotient of the commuting graph by a group action, which interpolates between the ordinary commuting graph and the commuting graph of conjugacy classes. The theorems are unconditional group-structure statements, and the paper contains no fitted parameters or ad hoc assumptions; the arguments are deductions from published classifications. The organization is clear, and the examples in Remarks 3.5 and 3.8 are helpful. The central caveat is that several load-bearing steps are delegated to external results without precise statements, so the correctness of the main nilpotency and complete-vertex theorems cannot currently be checked from the manuscript alone.","major_comments":[{"comment":"This step excludes the nonabelian simple case, so it is load-bearing for the main nilpotency theorem. The proof says that because GK(G) is complete, 2 is a complete vertex, and then cites [15, Theorem 7.1] and [15, Corollary 7.6(2)] to conclude that no such simple group exists. The exact statements of these results are not given, and the inference is ambiguous: the corollary must rule out simple groups with 2 as a complete vertex in the precise sense needed, not merely rule out some other class. The distinction is not cosmetic: for example A_27 has 2 as a complete vertex of its prime graph while GK(A_27) is not complete, so '2 is complete' and 'the prime graph is complete' are genuinely different conditions. Please restate the cited results and show explicitly that they imply the absence of a nonabelian simple group with complete prime graph; alternatively, give a self-contained proof of that fact.","section":"Theorem 3.2, Step (2)"},{"comment":"The proof of Lemma 3.10 is not given: after reducing to field automorphisms of groups of Lie type, the text says 'Looking at the primitive prime divisors of these polynomials one can easily check that there exists a prime dividing |G| which does not divide |C_G(α)|.' This is the only proof of a statement used essentially in Step (5) of Proposition 3.11. Please provide the full check, or state and prove a general lemma with the relevant cyclotomic data; a citation to Table 6 of [3] together with a reference to a standard order formula would also need to be made explicit.","section":"Lemma 3.10"},{"comment":"The final contradiction of Proposition 3.11 depends on two more unstated external facts: the classification consequence from [15] that a nonabelian simple group with complete vertex 2 is A_n with p=2, and the claim from [9, Corollary 5, Table 10.7] that if π(M)=π(H) with M simple and H=C_M(z), then the only possibility is M≅PSU(4,2), H≅S_6. The covering condition M=⋃_{a∈A} H^a is used to get π(M)=π(H), but the passage from this to the unique pair (M,H) is not demonstrated. Please state the relevant results precisely and indicate how they apply; otherwise the exclusion of the remaining case is not checkable.","section":"Proposition 3.11, Step (6)"},{"comment":"The proof of Theorem 4.2 classifies the possibilities for G from the CP-group theorem and then excludes most of them with very brief remarks: 'one can observe that all nonsolvable groups other than PSL(2,5) ... do not satisfy the condition that each Sylow subgroup is elementary abelian', and a one-sentence exclusion of 2-Frobenius groups. Since Theorem 4.2 is the main result of Section 4, these exclusions should be written out, especially because the elementary-abelian-Sylow condition is exactly what distinguishes PSL(2,5) from the other candidate simple groups. The converse direction of the 'if and only if' is also only implicit.","section":"Theorem 4.2"}],"minor_comments":[{"comment":"The notation \\bar G_p = P/M introduces P without defining it; please write 'where P is a Sylow p-subgroup of G containing M' to avoid ambiguity.","section":"Theorem 3.2, Step (3)"},{"comment":"The equality Γ(G,A)=Γ(G,A/C_A(G)) is clear but should be justified in a sentence, since the vertices are orbits of the action and the quotient acts with the same orbits.","section":"Definition 1.1"},{"comment":"The name 'Grünberg-Kegel graph' should be 'Gruenberg-Kegel graph' or 'prime graph' consistently, and the spelling should be checked in the abstract and Section 1.","section":"Throughout"},{"comment":"The necessary condition on N_A(P)-orbits is stated in a separate sentence after the 'if and only if'; making it an explicit part of the equivalence would clarify the proof of the converse direction.","section":"Theorem 4.2"},{"comment":"In the proof, the notation G=G/O_2(G) reuses the symbol G for the quotient; using \\bar G would avoid confusion in the later paragraphs about Sz(8).","section":"Theorem 5.2"}],"recommendation":"major_revision","confidential_remarks":"The main risk is that [15, Corollary 7.6(2)] may not mean what the proof of Theorem 3.2 needs; if so, the central nilpotency theorem is unproven. The authors should be asked to state the corollary verbatim and to show that it rules out a nonabelian simple group with complete prime graph, since the current citation is not verifiable from the text."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this paper is worth a serious look. It introduces the commuting graph Γ(G,A) of A-orbits, which genuinely unifies the ordinary commuting graph (A trivial) and Herzog et al.'s conjugacy-class commuting graph (A = Inn G). The main theorem (3.2) is a real result: if orbits of p-elements and q-elements are always adjacent for distinct primes, then G is nilpotent. The companion solvability criterion (3.6) and the classifications of edge-less and triangle-free cases (4.2, 5.2) are also new and clearly presented. The proofs are mostly reductions to known classifications—Parker, Vasiliev–Vdovin, Delgado–Wu, Arad–Chillag—so the novelty is in the definitions and the structural statements rather than in new machinery. That is fine, and the paper gives helpful examples showing the limits of the theorems.\n\nThe stress-test concern about Theorem 3.2 Step (2) does not hold up. The phrase \"no such simple group\" refers to a simple group with complete prime graph, not to A_n with no prime in [n−3,n]. Corollary 7.6(2) of Vasiliev–Vdovin is the standard result that no finite simple group has a complete prime graph. The authors should restate that corollary explicitly, because the current wording is ambiguous enough to trip up a careful referee—but the cited claim is correct, and the central argument stands.\n\nThe real soft spots are smaller. Lemma 3.10's proof says \"one can easily check\" using primitive prime divisors; a referee will want that written out or replaced by a Zsigmondy citation. Theorem 4.2's exclusion of the non-PSL(2,5) CP-groups is also summarized as \"one can observe,\" which is routine for experts but should be expanded. Theorem 2.2(ii) just cites Parker; that is acceptable. The paper leans on deep external classifications, but it says so and does not hide the reliance.\n\nThis paper is for people working on commuting graphs, prime graphs, or group actions and graph invariants. It is a good contribution, not a spectacular one. I would send it to a serious referee, expecting them to request clarifications and expanded routine checks, not a rewrite.","headline":"A solid, clearly written paper introducing a natural graph that unifies the commuting graph and the conjugacy-class commuting graph; the main nilpotency theorem is real, and the stress-test's worry about the Vasiliev–Vdovin citation does not hold up.","tokens_in":11427,"tokens_out":12019,"would_cite":true,"duration_ms":107513,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["20D10","20D15","20D45"],"pacs":[],"model":"deepseek-v4-flash","headline":"If every prime-element orbit is adjacent to every other across distinct primes, the finite group is nilpotent.","keywords":["commuting graph","A-orbits","group action by automorphisms","nilpotent groups","Frobenius groups","prime graph","triangle-free graph","finite groups"],"falsifier":"A direct counterexample would be a non-nilpotent finite group $G$ with an automorphism group $A$ such that for every pair of distinct primes $p,q$ and every $p$-element $x$ and $q$-element $y$, some $a \\in A$ makes $x$ commute with $y^a$; searching small groups for such a pair would settle the point.","tokens_in":10445,"feed_emoji":"🕸️","tokens_out":13624,"duration_ms":118987,"temperature":0.7,"pith_summary":"This paper introduces the commuting graph of $A$-orbits $\\Gamma(G,A)$: vertices are the orbits of a finite group $A$ acting by automorphisms on a finite group $G$, and two orbits form an edge when some element of one commutes with some element of the other. The main theorem states that if, for every pair of distinct primes $p$ and $q$, every $A$-orbit of a $p$-element is adjacent to every $A$-orbit of a $q$-element, then $G$ is nilpotent. A direct corollary is that whenever $\\Gamma(G,A)$ is a complete graph for some automorphism group $A$, the group $G$ is nilpotent. The paper also shows that for solvable $G$, disconnection of $\\Gamma(G,A)$ exactly detects Frobenius and 2-Frobenius structure, and it classifies the isolated-vertex and triangle-free cases. The upshot is a graph-theoretic commutation condition that forces a structural conclusion about the entire group.","feed_headline":"Complete orbit-commuting graph forces nilpotency","feed_subtitle":"A graph built from automorphism orbits turns a commutation condition into a structural verdict on finite groups.","key_machinery":"The central object is $\\Gamma(G,A)$, the commuting graph of $A$-orbits: vertices are the orbits of $G\\setminus\\{1\\}$ under the automorphism action of $A$, and two distinct orbits are joined when some element of one commutes with some element of the other. The argument connects this graph to the prime graph $\\operatorname{GK}(G)$: partitioning the prime-order orbits by the prime $p$ gives a quotient graph isomorphic to $\\operatorname{GK}(G)$. The nilpotency proof proceeds by minimal-counterexample induction, uses a unique minimal normal $A$-invariant subgroup, and invokes the classification of prime graphs of nonabelian simple groups as a black box to exclude the simple case; a module-decomposition argument then produces the final contradiction.","core_discovery":"The central claim, Theorem 3.2, is that a finite group $G$ is nilpotent if the following holds: for any two distinct primes $p,q$ and any elements $x,y \\neq 1$ with $x$ a $p$-element and $y$ a $q$-element, the orbits $xA$ and $yA$ are adjacent in $\\Gamma(G,A)$, meaning some element of $xA$ commutes with some element of $yA$. The proof runs by minimal counterexample: every proper $A$-invariant subgroup and every quotient by a proper $A$-invariant normal subgroup is nilpotent, forcing a unique minimal normal $A$-invariant elementary abelian $p$-subgroup $M$ with $G/M$ nilpotent. It then rules out the case where $G$ is a nonabelian simple group by observing that the hypothesis would make the prime graph complete, contradicting the known classification of prime graphs of finite simple groups. The remaining nonsimple configuration is contradicted by decomposing $M$ into homogeneous components as a module and producing an element $x \\in M$ whose centralizer is $M$, so its orbit cannot be adjacent to an orbit of a $q$-element. Theorem 3.3 draws the corollary: if $\\Gamma(G,A)$ is complete for some $A \\le \\operatorname{Aut}(G)$, then $G$ is nilpotent.","pith_inferences":["The criterion suggests a computational nilpotency test: for a given pair $(G,A)$, checking adjacency between orbits of elements of distinct prime orders is finite, and any non-nilpotent group passing the test would directly falsify Theorem 3.2.","Because $\\Gamma(G,A)$ depends only on $A$ through its action, the theorem applies to any subgroup of automorphisms; one natural extension would be to replace automorphisms by arbitrary permutations of $G$ preserving the identity, though the proof's group-theoretic structure would not carry over automatically.","The proof inherits the full weight of the classification of simple-group prime graphs, so a classification-free proof would be needed if one wants the nilpotency result as an elementary theorem.","The connectedness theorem for solvable groups suggests that the number of components of $\\Gamma(G,A)$ could serve as an invariant for recognising Frobenius and 2-Frobenius structure under arbitrary automorphism actions."],"forward_implications":["If a single automorphism group $A$ makes $\\Gamma(G,A)$ complete, $G$ is nilpotent; conversely, a nonabelian nilpotent group need not admit such an $A$, since $D_8$ with its full automorphism group does not give a complete graph.","For solvable $G$, $\\Gamma(G,A)$ is disconnected exactly when $G$ is Frobenius or 2-Frobenius; when connected its diameter is at most 8, and when disconnected the number of components is one plus the number of $A$-orbits on the Frobenius complements.","A complete vertex $zA$ whose centralizer $C_G(z)$ is nilpotent forces $G$ to be nilpotent, and the same pattern with solvability instead of nilpotency also holds.","If $\\Gamma(G,A)$ is triangle free, then $G$ is a CP-group; if it is nonsolvable, it must be one of $\\operatorname{PSL}(2,q)$ for $q \\in \\{5,7,8,9\\}$, $\\operatorname{PSL}(3,4)$, or a group with a nontrivial normal 2-subgroup whose quotient is $\\operatorname{PSL}(2,4)$ or $\\operatorname{PSL}(2,8)$.","With $Z(G)=1$, an edgeless graph with more than one vertex occurs exactly when $G$ is $\\operatorname{PSL}(2,5)$ or a Frobenius group with elementary abelian kernel and complement of prime order."],"supporting_citations":[{"why":"Supplies the classification input that the prime graph of a nonabelian finite simple group is not complete, used to exclude the simple case in Theorem 3.2.","marker":"[15]"},{"why":"Provides the structure and diameter results for commuting graphs of solvable groups used in the connectedness theorem and the diameter bound.","marker":"[13]"},{"why":"Defines the commuting graph on conjugacy classes, the inner-automorphism case that Γ(G,A) generalizes and that motivates the complete-vertex analysis.","marker":"[8]"},{"why":"Supplies the solvability criterion about nonsolvable subgroups generated by elements of prescribed prime orders used in the solvability analogue Theorem 3.6.","marker":"[6]"},{"why":"Provides the theorem on centralizers of p-elements underlying the isolated-vertex conclusion that Sylow subgroups are elementary abelian CC-subgroups.","marker":"[2]"},{"why":"Classifies groups in which every element has prime power order, used in the isolated-vertex and triangle-free structure theorems.","marker":"[5]"},{"why":"Supplies the order and centralizer data used in Lemma 3.10 and in excluding the Suzuki group in the triangle-free theorem.","marker":"[3]"}],"fun_headline_variants":["Orbit-commuting graph completeness forces finite group nilpotency","If every pair of prime-order orbits commutes, G is nilpotent","Complete commuting graph of A-orbits implies nilpotent group","Nilpotency forced by complete orbit-commuting graph"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is the external classification input, used without proof, that no nonabelian finite simple group has a complete prime graph; if that input failed or was misapplied, the proof's exclusion of the simple case would collapse and Theorem 3.2 would be unsupported.","fun_headline_variants_meta":{"raw":{"variants":["Orbit-commuting graph completeness forces finite group nilpotency","If every pair of prime-order orbits commutes, G is nilpotent","Complete commuting graph of A-orbits implies nilpotent group","Nilpotency forced by complete orbit-commuting graph"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000512,"raw_usage":{"total_tokens":2446,"prompt_tokens":862,"completion_tokens":1584,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":478,"completion_tokens_details":{"reasoning_tokens":1509}},"tokens_in":478,"tokens_out":1584,"duration_ms":12472,"temperature":1.0,"reasoning_tokens":1509,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:33:45.456512+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A direct counterexample would be a non-nilpotent finite group $G$ with an automorphism group $A$ such that for every pair of distinct primes $p,q$ and every $p$-element $x$ and $q$-element $y$, some $a \\in A$ makes $x$ commute with $y^a$; searching small groups for such a pair would settle the point.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the classification input that the prime graph of a nonabelian finite simple group is not complete, used to exclude the simple case in Theorem 3.2."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the structure and diameter results for commuting graphs of solvable groups used in the connectedness theorem and the diameter bound."},{"cited_title":"Herzog, P","cited_arxiv_id":null,"evidence_quote":"Defines the commuting graph on conjugacy classes, the inner-automorphism case that Γ(G,A) generalizes and that motivates the complete-vertex analysis."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the solvability criterion about nonsolvable subgroups generated by elements of prescribed prime orders used in the solvability analogue Theorem 3.6."},{"cited_title":"Al- gebra 51 (1978) 164–172","cited_arxiv_id":null,"evidence_quote":"Provides the theorem on centralizers of p-elements underlying the isolated-vertex conclusion that Sylow subgroups are elementary abelian CC-subgroups."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Classifies groups in which every element has prime power order, used in the isolated-vertex and triangle-free structure theorems."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the order and centralizer data used in Lemma 3.10 and in excluding the Suzuki group in the triangle-free theorem."}],"review_version":1}