{"id":"e7a2a389-1ce7-497a-83f1-db62ab62f957","arxiv_id":"2607.28785","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Three positive point charges can have at most six nondegenerate equilibrium positions, improving the previous upper bound of twelve.","lead":"A mathematics paper improves the upper bound on the number of equilibrium points of three charged particles from 12 to 6, bringing Maxwell's 150-year-old problem closer to its conjectured answer of 4. The proof uses a new geometric separation argument inside a known algebraic framework.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Genericity proof rests on an unembedded exact computation; if gcd claims in (5.5) fail, Proposition 5.1 and the 6-bound collapse.","rationale":"The paper's main new mathematical contribution—the separation argument and four-contact lemma (Sections 3–4)—is carefully argued and internally consistent. My reading of Lemma 4.2 found no gap: the parity argument excludes all cases with fewer than four contacts, and the saddle-separation lemma correctly forces the two simple critical points to lie on opposite sides of the separatrix. The perturbation argument for arbitrary parameters is also sound. The single load-bearing point is the genericity proof in Section 5, where the entire Zariski-open set U rests on the exact computation at the witness θ*. The paper asserts exact identities but supplies only a reference to an external script, not the computation itself. This is a verification gap rather than an evident mathematical error: the computation is finite and checkable, and if correct, the proof goes through. However, because the theorem's proof depends on this unshown computation, acceptance should be conditional on an independent check. This matches the reader's identified weakest assumption, hence agreement.","tokens_in":7941,"tokens_out":31389,"duration_ms":309054,"concrete_test":"Independently run exact rational arithmetic (e.g., in Sage or SymPy) at θ*=(3/10,7/5,7/10,14/5,1/2) using definitions (2.4)–(2.15): (i) compute gcd(Q,R) in Q[f,g] and verify it is 1; (ii) compute r2=Res_g(Q,Q_g), r4=Res_g(Q_f,Q_g), their degrees, and gcd(r2,r4), verifying equality with fξ3(f). If any of these claims fail, Proposition 5.1 collapses and the 6-bound is unproved; if they pass, the genericity step is sound.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Section 5's genericity proof, which allows Proposition 2.1 to be applied in every quadrant, hinges entirely on exact rational arithmetic at the single witness θ*=(3/10,7/5,7/10,14/5,1/2). Specifically, display (5.5) asserts gcd(Q,R)=1 in Q[f,g] and gcd(r2,r4)=fξ3(f), with deg_f r2=24 and deg_f r4=21. These identities are used to deduce (G1) and (G2) on a nonempty Zariski-open set U; if either gcd computation is wrong, U may be empty and the four-contact lemma cannot be invoked, so the bound N≤6 in (2.18)–(2.19) is unsupported. The paper does not reproduce the computation or its output; it only points to an external script verify_genericity.py. The subresultant and degree-stability arguments are valid consequences once (5.5) is known, but (5.5) itself is asserted rather than demonstrated.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves Theorem 1.1: for every n≥2 and every α>0, the potential of three positive point charges in R^n has at most six nondegenerate equilibrium points. The proof sharpens the authors' earlier bound of twelve by proving a four-contact lemma: on the oval component O of the contact curve Γ in a quadrant, the auxiliary polynomial R has at least four zeros counted with multiplicity. The key new ingredients are a separation lemma for the level sets of a separated primitive Φ at its unique saddle point, a parity/counting argument on a circle, and a genericity result (Proposition 5.1) verified by exact arithmetic at a single rational witness θ*. The paper states that a reproducible script verify_genericity.py accompanies the source.","tokens_in":8214,"tokens_out":8075,"duration_ms":82755,"significance":"If the result holds, this is a substantial improvement on the three-charge case of Maxwell's problem, reducing the best known upper bound from 12 to 6 and nearly reaching Maxwell's conjectural bound of 4. The four-contact lemma and the separation lemma are elegant and appear new; they are proven rigorously and in detail. The genericity verification is honest: the authors rely on exact rational arithmetic at a witness and provide a reproducibilty statement rather than numerical sampling. The paper also gives computational checks saturating the mixed-volume count, which clarifies the remaining slack in the method and strengthens confidence in the sharpness of the approach. The central derivation is sound, but the proof as written depends on an externally supplied computation that is not embedded in the manuscript.","major_comments":[{"comment":"The proof of Proposition 5.1, and hence the entire Theorem 1.1, rests on the exact arithmetic assertions gcd(Q,R)=1 and gcd(r2,r4)=fξ3(f) at the witness θ*. These assertions are not demonstrated in the text; the script is only referenced. As written, the proof of (G1) and (G2) is conditional on an externally supplied computation. Please include the computation output or provide an appendix with the relevant resultant/subresultant values so a reader can verify (5.5) without running the script. This is load-bearing: if either gcd assertion fails, Proposition 2.1 cannot be applied to the three non-positive quadrants and the bound N≤6 collapses.","section":"Section 5, Eq. (5.5)"},{"comment":"The step 'the subresultant criterion, together with (5.4), then shows...' needs more detail. To conclude that gcd(r2,r4)=fξ3(f) on a Zariski-open neighborhood of θ*, one must specify which subresultant is nonzero at θ* (the one forcing gcd degree 3) and which higher subresultants vanish. Without this information, the passage from the single-witness computation to the open-set statement is a gap, albeit a fillable one. The authors should present the subresultant chain or a direct certificate for (5.5).","section":"Section 5, Eq. (5.6)"}],"minor_comments":[{"comment":"The referenced script verify_genericity.py should be included as an ancillary file or appendix with version/checksum information, so that the exact computation is reproducible from the published version.","section":"Section 5, paragraph after (5.5)"},{"comment":"Add parentheses for clarity: Q = -((1+2α)/(α+1)^2) ξ1ξ2ξ3 - fgQ1, to avoid misreading the sign.","section":"Equation (4.1)"},{"comment":"The caption text 'equilibria = 1 2; 2 crosses O+ , budget 2 + 2 = 4' is cryptic; please expand it so the reader can interpret the figure's relation to the proof.","section":"Figure 1 caption"},{"comment":"The statement 'Q=R=0 has exactly four real solutions in each open quadrant' is a computational check for ten parameter sets; the paper correctly does not use it as evidence for Theorem 1.1. It may help to explicitly say this check is not part of the proof.","section":"Section 6"}],"recommendation":"major_revision","confidential_remarks":"The main proof is sound in structure, but the genericity proof in Section 5 relies on an exact arithmetic computation that is not included in the manuscript. Since the computation is the only load-bearing unverified step, I recommend major revision to make it checkable. If the computation is confirmed, this paper should be accepted. The novelty and importance of the result are high."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know this paper delivers what it promises. The bound on nondegenerate equilibria for three positive charges drops from 12 to 6, and the main new tool—the separation lemma at the saddle of a separated-variable first integral, leading to the four-contact lemma—is clever and carefully argued. The proof is not a black box; the geometry is clear and the key lemmas are rigorous.\n\nWhat is new: Proposition 2.1, the four-solution proposition. The reduction to the auxiliary system Q=R=0 is inherited from the authors' earlier paper [4], and they say so explicitly. That is legitimate reliance, not a gap. The four-contact lemma (Lemma 4.2) is the real contribution: it rules out low-multiplicity configurations by parity and by the separation property of the saddle. I found the argument convincing.\n\nThe soft spot is Section 5. The genericity assumptions (G1) and (G2) are verified at a single rational witness θ* via exact arithmetic, and the paper says the computation is short and a script is available. But the actual output of the gcd computations in (5.5) is not reproduced. That is a minor weakness—exactly the kind of thing a referee can check in ten minutes—and it is not a reason to reject. The stress-test note worries that if the gcd claims were wrong the whole bound collapses; that is true, but there is no indication they are wrong, and the authors point to a reproducible script. Still, for a paper whose main theorem depends on it, embedding the output would have been better.\n\nThe perturbation argument at the end is standard and correct: the bound persists to all parameters by the implicit function theorem. The paper is honest about the remaining gap to Maxwell's conjectured bound of 4.\n\nWho is this for? Anyone working on Maxwell's problem, fewnomials, or Rolle–Khovanskii theory. It deserves a serious referee. The main thing I'd ask the referee to do is re-run or verify the exact computation at θ* and check the subresultant degree-stability argument. If that checks out, this is a solid contribution.","headline":"A real step forward on a classical problem: the new four-contact lemma gives 6 instead of 12, and the only genuine soft spot is that the genericity check at the witness is asserted rather than shown.","tokens_in":8660,"tokens_out":2338,"would_cite":true,"duration_ms":25874,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["31B05","34C08","58K05"],"pacs":[],"model":"deepseek-v4-flash","headline":"For three positive point charges, the number of nondegenerate equilibrium points is at most six, for every charge strength, every exponent α>0, and every dimension n≥2—a sharpening of the previous upper bound of twelve.","keywords":["point charges","equilibrium points","critical points","potential theory","three charges","fewnomials","upper bounds","nondegenerate"],"falsifier":"Run the exact-arithmetic computation at the witness parameter θ* = (3/10, 7/5, 7/10, 14/5, 1/2): if gcd(Q,R)≠1 or gcd(r2,r4) gains an extra real factor beyond f ξ3(f), the genericity step collapses. Independently, a numerical search for a three-charge configuration with eight or more nondegenerate equilibrium points would directly refute the bound of six.","tokens_in":7869,"feed_emoji":"⚡","tokens_out":7327,"duration_ms":67940,"temperature":0.7,"pith_summary":"This paper establishes that a potential generated by three positive point charges has at most six nondegenerate equilibrium points, for any charge magnitudes, any exponent α>0, and any dimension n≥2. The previous bound was twelve. The improvement comes from proving a missing auxiliary statement: an associated polynomial system Q=R=0 has at least four solutions, counted with multiplicity, in each open quadrant of the two-dimensional (f,g)-plane. The proof uses a separation lemma at the unique saddle point of a separated-variable first integral Φ=u(f)+s(g), followed by a four-contact lemma showing that the oval component of the contact curve Γ={Q=0} must meet the separatrix level at least four times. As a consequence, the number of nondegenerate equilibria for three charges is always 2, 4, or 6.","feed_headline":"Three-charge equilibrium cap cut from 12 to 6","feed_subtitle":"Proof shows any three positive charges, in any dimension and any power law, have at most six force-balance points.","key_machinery":"The load-bearing mechanism is the four-contact lemma applied to the compact oval O⊂Γ, where Γ={Q=0} is the contact curve of two closed logarithmic one-forms defined from the three-charge potential. On O, the auxiliary polynomial R is proportional to the derivative of the first integral Φ restricted to O. The separated-variable form Φ=u(f)+s(g) gives Φ a unique nondegenerate saddle p in each open quadrant, and the separation lemma shows that the level set {Φ=c0} splits that quadrant into exactly two connected components separated by the line {f=f0}. A nonconstant function on a circle with at least two distinct critical points and an even number of odd-order critical points must have total cri","core_discovery":"The paper proves that a potential of the form Vα = Σ ζ_i ρ_i^{-α}, with three positive charges in R^n and α>0, has at most six nondegenerate critical points. The argument reduces critical points to intersections of two auxiliary curves in the positive quadrant of an (f,g)-plane, then sharpens an auxiliary count from twelve to six. The new ingredient is a proof that the polynomial system Q=R=0 has at least four solutions, counted with multiplicity, in every open quadrant. This is obtained by a separation lemma at the unique saddle point of the separated-variable first integral Φ=u(f)+s(g), followed by a four-contact lemma: a nonconstant function on the oval component of Γ={Q=0} must have tota","pith_inferences":["The separation mechanism—a separated one-well/one-hill first integral whose saddle level set splits a quadrant into exactly two components—is a general geometric fact that could yield four-contact lower bounds in other two-dimensional counting problems governed by closed one-forms.","If a configuration with six equilibria is eventually found, it would saturate the new bound and confirm that the method is sharp; the paper leaves open whether such a configuration exists for special values of α, so a targeted search near parameters with four positive-quadrant crossings is a natural next test.","The proof's reliance on exact rational arithmetic at one witness parameter is a testable point: an independent symbolic verification of the two resultant computations would make the genericity argument fully self-contained and could be automated for neighboring parameters.","The sharpness analysis suggests that the slack in the current method is concentrated in the first Rolle step, so future upper bounds for configurations of four or more charges should target that inequality rather than the mixed-volume count."],"forward_implications":["For every α>0 and every dimension n≥2, any configuration of three positive point charges has 2, 4, or 6 nondegenerate equilibrium points, never more.","The improvement is achieved by saturating the mixed-volume count: the three quadrants outside the positive one now contribute at least 16 of the 28 torus solutions counted by the Bernstein–Kushnirenko bound.","To reach the conjectured bound of 4 for three charges, one only needs to show that when the auxiliary curve γ2 crosses the oval in four points, the first Rolle step overcounts by at least 2; equivalently, that there is at most one local minimum.","The theorem covers all dimensions n≥2 because every equilibrium point lies in the affine span of the three charges, so the problem reduces to a plane.","All tested parameter sets show exactly four real solutions of Q=R=0 in each open quadrant, indicating that the new auxiliary count is generically sharp."],"fun_headline_variants":["Three charges, max six equilibrium points: proof","Maxwell problem bound tightened: 12 to 6","Six equilibria maximum for three positive charges","Sharpened bound: three charges give at most six"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The genericity proof uses exact rational arithmetic at one parameter value to certify that two auxiliary polynomials are coprime and that their resultants have no unexpected common factors; if that single computation, or its extension to a Zariski-open neighborhood, is mistaken, the four-contact lemma cannot be applied.","fun_headline_variants_meta":{"raw":{"variants":["Three charges, max six equilibrium points: proof","Maxwell problem bound tightened: 12 to 6","Six equilibria maximum for three positive charges","Sharpened bound: three charges give at most six"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000696,"raw_usage":{"total_tokens":2938,"prompt_tokens":656,"completion_tokens":2282,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":400,"completion_tokens_details":{"reasoning_tokens":2221}},"tokens_in":400,"tokens_out":2282,"duration_ms":16241,"temperature":1.0,"reasoning_tokens":2221,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T00:22:17.861850+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the exact-arithmetic computation at the witness parameter θ* = (3/10, 7/5, 7/10, 14/5, 1/2): if gcd(Q,R)≠1 or gcd(r2,r4) gains an extra real factor beyond f ξ3(f), the genericity step collapses. Independently, a numerical search for a three-charge configuration with eight or more nondegenerate equilibrium points would directly refute the bound of six.","supporting_citations":[],"review_version":1}