{"id":"a5dce476-d097-45b1-815d-e6d3eaa94f4f","arxiv_id":"2607.19110","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every complete multipartite graph K(3,2^β) is e-positive, completing the e-positive classification for complete multipartite graphs.","lead":"This paper proves that a family of complete multipartite graphs, K(3,2^β), has e-positive chromatic symmetric functions, with an explicit nonnegative formula. Combined with prior work, this completes the classification of all e-positive complete multipartite graphs.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Only-if direction of the classification rests entirely on the external Schur-positivity theorem; the internal e-positivity proof is sound.","rationale":"The reader's weakest assumption correctly identifies the external Schur-positivity classification as the load-bearing dependency for the 'only if' direction of Corollary 1.3. I checked the internal proof of Theorem 1.2: the marker-variable extraction (Theorem 3.2), the support restriction (Lemma 3.1), the marker coefficient lemma (Lemma 3.3), the Dickson-polynomial reductions (Lemma 3.4), and the three coefficient evaluations (Lemmas 4.1, 4.2, 4.4, 4.5) are consistent with the displayed expansions for β=1,2,3. No internal contradiction or missing case was found in the e-positivity argument itself. The only caveat is that the long algebraic simplifications are not machine-checked, but the small-case checks and the structural clarity of the recurrences make an error unlikely. The external theorem dependency is real but not a flaw in this paper; it is a legitimate use of a cited result. Therefore the reader's ACCEPT verdict stands, and the concern does not change it.","tokens_in":17862,"tokens_out":34226,"duration_ms":262734,"concrete_test":"For all partitions λ with |λ|≤9, compute X_{K_λ} explicitly in both the elementary and Schur bases (e.g., via Sage's SymmetricFunctions and a direct chromatic-symmetric-function implementation for complete multipartite graphs). Check that e-positivity holds exactly for λ of length one, all parts 1/2, or λ=(3,2^β), and that Schur-positivity holds exactly for the Shelburne–van Willigenburg list. Any mismatch would identify a missing or erroneous case in the external theorem. Additionally, recompute the β=4 expansion from formula (1.1) and compare it term-by-term with the direct e-basis computation of X_{K(3,2,2,2,2)} to further validate the internal coefficient evaluations.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Corollary 1.3's 'if and only if' statement depends critically on Theorem 1.1(ii), quoted from Shelburne–van Willigenburg (arXiv:2604.26158): a complete multipartite graph K_λ is Schur-positive only if all parts are 1 or 2, or λ=(3,2^β). Since e-positivity implies Schur-positivity, any missing case in that external classification would directly create missing cases in the e-positive classification. The paper does not reprove or independently verify Theorem 1.1(ii); it is imported as a black box. This is not an internal inconsistency, and the proof of e-positivity for K(3,2^β) (Theorem 1.2) is self-contained and, based on the β=1,2,3 expansions, correct. But the classification claim is only as secure as that external theorem, which is the least-secure link in the paper's central claim.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves that the chromatic symmetric function of the complete multipartite graph K_{(3,2^β)} is e-positive for every β≥1, giving an explicit expansion in the elementary basis with coefficients expressed through restricted-injection numbers a_d. The proof introduces a marker-variable coefficient-extraction formula for arbitrary complete multipartite graphs, derived from the elementary–monomial Cauchy identity, and reduces the calculation to three coefficient families evaluated via Dickson polynomials. Combining the main theorem with the Shelburne–van Willigenburg Schur-positivity classification yields a complete classification of e-positive complete multipartite graphs.","tokens_in":18107,"tokens_out":25208,"duration_ms":208923,"significance":"If the result holds, it resolves an open case in e-positivity of complete multipartite graphs and completes the classification. The explicit Cauchy-identity based coefficient extraction (Theorem 3.2) is a useful tool that may apply to other families. The proof is self-contained for the main theorem, with detailed lemmas; the small cases β=1,2,3 in the introduction match the formula. The classification's 'only if' direction is inherited from an external theorem (Theorem 1.1(ii)), which is clearly stated; this is a dependence, not a gap in the paper.","major_comments":[],"minor_comments":[{"comment":"The formula for β=3 is split over two lines in the text; ensure the typeset version aligns the display. Also, use consistent notation for elementary symmetric functions, e.g., e_{...} rather than e9 in running text.","section":"§1, displayed expansions"},{"comment":"The phrase 'multiplying by the scalar factor η! to restore the labelings within the partite sets' is correct but terse. A one-sentence explanation of the multinomial count (η_i! / ∏_c j_c!) would help readers see why the η! factor is the right normalization.","section":"Theorem 3.2"},{"comment":"In the r=0 second case, the count implicitly includes an (s−1)! assignment of the selected variables to the remaining E_2 factors. Spelling this out would prevent reader confusion about the origin of the s! factor in the formula.","section":"Lemma 3.3, proof"},{"comment":"The necessity direction relies entirely on Theorem 1.1(ii), which is imported from a preprint. The authors may wish to state this conditionality explicitly in the abstract or in the proof of the corollary, so that readers know the classification is only as strong as that external theorem.","section":"Corollary 1.3"},{"comment":"The title appears with unwanted spacing as 'ANe-POSITIVE CLASSIFICATION FOR COMPLETE MUL TIP AR TITE GRAPHS'; please fix the title formatting in the final version.","section":"General typography"}],"recommendation":"accept","confidential_remarks":"This is a solid, self-contained proof of an open case in e-positivity, with a new coefficient-extraction technique of independent interest. The only caveat is the reliance on the external Shelburne–van Willigenburg classification for the converse direction; the authors clearly flag this dependence, so it does not undermine the paper's contribution. I recommend acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know upfront: this paper closes the open case from Shelburne–van Willigenburg's Schur-positivity classification by proving K(3,2^β) is e-positive, and it does so with an explicit, manifestly nonnegative e-expansion. The main theorem (Theorem 1.2) is the real deal. The formula is concrete, checked against β=1,2,3, and the positivity falls out of the restricted-injection numbers a_d.\n\nWhat's actually new: the marker-variable coefficient-extraction formula (Theorem 3.2), derived from the elementary–monomial Cauchy identity, is a nice tool that applies to any complete multipartite graph. The use of Dickson polynomials to evaluate the three surviving coefficient families is fresh and turns a potentially ugly computation into something structured. The proof is essentially self-contained from standard identities—Cauchy, Girard–Waring, Newton–Girard, Vieta—and the appendix gives an independent acyclic-orientation proof of the top coefficient, which is a good sanity check.\n\nSoft spots: the \"if and only if\" classification (Corollary 1.3) inherits the external Shelburne–van Willigenburg theorem. The paper does not reprove Theorem 1.1(ii), and since e-positivity implies Schur-positivity, any missing case in that external classification would create missing cases here. That is a real dependency, but not a flaw in this paper's internal proof of e-positivity for the (3,2^β) family—it is a caveat about how much the classification claim rests on prior work. The other soft spot is that the algebraic manipulations in Section 4 are long and not machine-checked; that is typical for this kind of computation, and the cross-checks for small β plus the alternative orientation argument supply reasonable evidence.\n\nOverall: the paper is solid, well-written, and the citation pattern is honest. It deserves a serious referee. The referee should focus on verifying the coefficient evaluations and on whether Theorem 1.1(ii) really is exactly the right external statement. For anyone working on chromatic symmetric functions or e-positivity, this is a paper to know.\n\nMy recommendation: send it to peer review.","headline":"Resolves the last open e-positivity case for complete multipartite graphs with an explicit, checkable expansion; the only real caveat is that the 'if and only if' classification rests on an external Schur-positivity theorem.","tokens_in":18563,"tokens_out":1884,"would_cite":true,"duration_ms":16979,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E05","05C15","05A15"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that, for every β ≥ 1, the complete multipartite graph K_{(3,2^β)} is e-positive, and that together with the known Schur-positivity classification this completely characterizes which complete multipartite graphs have e-pos","keywords":["chromatic symmetric function","e-positivity","complete multipartite graph","Schur positivity","restricted-injection numbers","Dickson polynomials","coefficient extraction","acyclic orientations"],"falsifier":"Independently compute the chromatic symmetric function of K_{(3,2,2)} (β=2) in the monomial or power-sum basis and convert to the elementary basis. The paper predicts X = 1988 e_7 + 268 e_{(6,1)} + 12 e_{(5,2)} + 4 e_{(4,3)} + 12 e_{(5,1,1)} + 2 e_{(3,3,1)}; likewise, counting acyclic orientations with exactly three sinks should give β!a_β = 14. Any mismatch falsifies the main theorem.","tokens_in":17780,"feed_emoji":"🎨","tokens_out":8293,"duration_ms":75449,"temperature":0.7,"pith_summary":"This paper settles the last open case in the e-positivity problem for complete multipartite graphs. The chromatic symmetric function X_{K_{(3,2^β)}} is proved to expand in the elementary basis with explicitly given nonnegative integer coefficients for every β≥1. The coefficients are built from the restricted-injection numbers a_d, and the proof is a marker-variable coefficient extraction that reduces the calculation to three finite coefficient families evaluated with Dickson polynomials. Together with the previously established Schur-positivity classification for complete multipartite graphs, this yields a complete characterization: X_{K_λ} is e-positive exactly when λ has one part, all parts are 1 or 2, or λ=(3,2^β).","feed_headline":"The last open multipartite graph family is e-positive","feed_subtitle":"Explicit nonnegative coefficients complete the e-positivity classification of complete multipartite graphs.","key_machinery":"The main device is a marker-variable coefficient-extraction formula for arbitrary complete multipartite graphs, derived from the elementary–monomial Cauchy identity. Each partite set is assigned a marker variable, and the chromatic symmetric function is recovered by extracting one marker monomial from a product whose factors are the elementary symmetric functions of a root sequence; by Vieta's formulas those elementary symmetric functions are expressed directly in the markers. For K(3,2^β) the calculation is carried out modulo the square of the degree-three elementary symmetric function, which collapses the surviving terms to three coefficient families. The power sums that appear are rewritt","core_discovery":"The central claim is Theorem 1.2: for every β≥1, X_{K(3,2^β)} equals β! times a sum of elementary symmetric functions whose coefficients are manifestly nonnegative and are expressed through the restricted-injection numbers a_d. This proves that K(3,2^β) is e-positive. Since e-positivity implies Schur-positivity, the family K(3,2^β) also becomes Schur-positive. Combining this with the existing Schur-positivity classification, the paper obtains Corollary 1.3: a complete multipartite graph K_λ has an e-positive chromatic symmetric function if and only if λ has length one, all parts lie in {1,2}, or λ=(3,2^β) for some β≥1.","pith_inferences":["A natural testable extension is to run the same marker-root computation on K_{(a,2^β)} for fixed a≥4; the cubic quotient would become a degree-a quotient, and the point where coefficients turn negative would reveal what is special about a=3.","The derangement-like nature of a_d hints at a direct bijective model for the e-coefficients, for instance through acyclic orientations or nonattacking rook placements, that would re-derive the expansion without analytic identities.","The theorem's separation of 'if' from 'only if' means the classification is only as strong as the Schur-positivity classification it invokes; a reader who trusts that classification gets the complete picture, while the K(3,2^β) expansion remains valid even if the classification were revised."],"forward_implications":["The e-positive complete multipartite graphs are now exactly those with one part, all parts in {1,2}, or shape (3,2^β).","Every K_{(3,2^β)} is Schur-positive, giving an infinite family of Schur-positive complete multipartite graphs beyond the parts-1-or-2 case.","The explicit coefficients provide a finite arithmetic description of all e-expansion coefficients of K_{(3,2^β)} via the recurrence for a_d, so positivity can be checked without case-by-case computation.","The appendix's orientation interpretation shows β!a_β acyclic orientations of K_{(3,2^β)} have exactly three sinks, and the top coefficient counts acyclic orientations with a unique sink.","The marker-variable extraction formula (Theorem 3.2) applies to every complete multipartite graph, giving a reusable engine for future e-coefficient computations."],"fun_headline_variants":["e-positivity of K(3,2^β) settled","K(3,2^β) e-positive completes classification","All e-positive multipartite graphs now classified","Open question solved: K(3,2^β) e-positive"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The completeness of the e-positivity classification depends on the previously proved statement that a complete multipartite graph is Schur-positive only when all its parts are 1 or 2 or it has the form (3,2^β); if that statement had a missing case, the 'only if' direction would fail.","fun_headline_variants_meta":{"raw":{"variants":["e-positivity of K(3,2^β) settled","K(3,2^β) e-positive completes classification","All e-positive multipartite graphs now classified","Open question solved: K(3,2^β) e-positive"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000873,"raw_usage":{"total_tokens":3592,"prompt_tokens":699,"completion_tokens":2893,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":443,"completion_tokens_details":{"reasoning_tokens":2833}},"tokens_in":443,"tokens_out":2893,"duration_ms":19818,"temperature":1.0,"reasoning_tokens":2833,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T13:24:50.938407+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Independently compute the chromatic symmetric function of K_{(3,2,2)} (β=2) in the monomial or power-sum basis and convert to the elementary basis. The paper predicts X = 1988 e_7 + 268 e_{(6,1)} + 12 e_{(5,2)} + 4 e_{(4,3)} + 12 e_{(5,1,1)} + 2 e_{(3,3,1)}; likewise, counting acyclic orientations with exactly three sinks should give β!a_β = 14. Any mismatch falsifies the main theorem.","supporting_citations":[],"review_version":1}