{"id":"9edb51a7-98f1-4e6e-b75c-6339b89d61cb","arxiv_id":"2410.12234","paper_version":2,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Power-saving bound on the exceptional set for the abc conjecture, obtained via density estimates on high-dimensional varieties using geometry of numbers and Fourier analysis.","lead":"The paper proves a power-saving upper bound on the number of exceptional coprime triples a+b=c that violate the quality bound in the abc conjecture. A generalist might read it because the abc conjecture is a central open problem in number theory whose resolution would affect many other results in arithmetic geometry.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"Reader's weakest assumption correctly flags the density bounds as critical, but without a demonstrated shortfall in those bounds or an inconsistency in how they are applied, no load-bearing concern is identified. The unverdicted status is therefore unchanged.","tokens_in":1551,"tokens_out":214,"duration_ms":16591,"concrete_test":"Extract the explicit power-saving exponent claimed in the main theorem and recompute it from the input exponents in the density bounds of the relevant sections; if the output exponent is positive, the central claim holds as stated.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The abstract states a power-saving bound obtained via density estimates on high-dimensional varieties using geometry of numbers and Fourier analysis. No internal inconsistency, hidden assumption, or failure of the stated methods to deliver a positive power saving is visible from the given description. The claim is weaker than the full abc conjecture, so the methods need only produce some positive saving rather than the full conjecture.","agreement_with_reader":"disagree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript studies coprime natural numbers a, b, c satisfying a + b = c and obtains a power-saving bound on the size of the exceptional set of such triples violating rad(abc) ≥ c^{1-ε} for any fixed ε > 0. The argument combines upper bounds on the density of integer points on certain high-dimensional varieties, derived via the geometry of numbers and Fourier analysis.","tokens_in":1608,"tokens_out":362,"duration_ms":17895,"significance":"If the stated density bounds hold with positive exponents, the result supplies the first explicit power-saving estimate on the exceptional set in the abc conjecture. This is a quantitative strengthening of the known finiteness statements and demonstrates that the methods of geometry of numbers and Fourier analysis can be combined to produce a saving; the paper does not claim the full conjecture but a weaker, verifiable statement about exceptions.","major_comments":[],"minor_comments":[{"comment":"The abstract states the existence of a power-saving bound but does not record the explicit exponent or the implied constant; adding this (even as O(X^θ) with θ < 1) would make the claim immediately verifiable from the opening paragraph.","section":null},{"comment":"The handling of the coprimality condition gcd(a,b,c)=1 is mentioned in the abstract but not expanded in the provided description; a short paragraph clarifying how the coprimality is preserved or removed in the density estimates would improve readability.","section":null},{"comment":"Notation for the exceptional set (e.g., whether it is counted by max(a,b,c) ≤ X or by c ≤ X) should be fixed consistently from the introduction onward.","section":null}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their positive assessment of our manuscript and for the recommendation of minor revision. The report accurately captures that our work establishes the first explicit power-saving bound on the exceptional set for the abc conjecture via density estimates on high-dimensional varieties.","responses":[],"tokens_in":1080,"tokens_out":68,"duration_ms":24234,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main takeaway is that Bernert et al. have established a power-saving bound for the exceptional set in the abc conjecture. Using upper bounds on integer points on high-dimensional varieties from the geometry of numbers and Fourier analysis, they show there are fewer bad triples than one might expect by a positive power of the size. This is new because previous approaches to abc exceptions did not achieve a power saving with these methods. The paper does a good job laying out the varieties that capture the condition and then applying the analytic tools to get the density bound. It is a direct attack on making the exceptional set smaller in a quantitative way. Where it might be soft is in the precise handling of the error terms from the Fourier analysis and ensuring that the coprimality does not erode the saving. High-dimensional geometry of numbers bounds can be delicate with the constants, and if the power ends up being very small it limits the impact. The abstract does not give the exponent, so the strength depends on how well the estimates close. This paper is for number theorists interested in the abc conjecture and its quantitative aspects. Anyone studying applications of analytic methods to Diophantine problems could get something out of it. It deserves a serious referee because the claim is specific and the methods are appropriate for the task. I would send it to peer review.","headline":"This paper gives a power-saving bound on the exceptional set for abc using geometry of numbers and Fourier analysis on varieties.","tokens_in":2074,"tokens_out":331,"would_cite":false,"duration_ms":27091,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[{"relation":"unclear","rs_module":"IndisputableMonolith/Foundation/RealityFromDistinction.lean","rs_theorem":"reality_from_one_distinction","paper_passage":"We obtain a power-saving bound on the size of the exceptional set of triples... upper bounds for the density of integer points on certain high-dimensional varieties, coming from the geometry of numbers and from Fourier analysis."},{"relation":"unclear","rs_module":"IndisputableMonolith/Cost/FunctionalEquation.lean","rs_theorem":"washburn_uniqueness_aczel","paper_passage":"The proof is based on a combination of bounds for the density of integer points on varieties, coming from the determinant method, Thue equations, geometry of numbers, and Fourier analysis."}],"headline":"Diophantine counting bounds on abc exceptions via Fourier/geometry methods; no RS overlap","alignment":"orthogonal","rationale":"Paper derives power-saving N_λ(X) ≪ X^{33/50} for abc triples via reduction to monomial equations (Prop 2.1), then Fourier (Prop 3.1), geometry of numbers (Prop 3.2), determinant/Thue bounds (Props 3.5-3.6) and combinatorial optimization. RS framework forces J-cost, φ, 8-tick period, D=3 from single distinction (reality_from_one_distinction, AbsoluteFloorClosure, AlexanderDuality). No shared machinery (no J(ρ), no φ-ladder, no recognition cost) and domain is pure analytic number theory.","tokens_in":57265,"confidence":"high","tokens_out":365,"duration_ms":6570,"cache_read_input_tokens":38528,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"The exceptional set of triples violating the abc conjecture admits a power-saving size bound.","keywords":["abc conjecture","exceptional set","power-saving bound","coprime triples","a+b=c","geometry of numbers","Fourier analysis","integer points on varieties"],"falsifier":"An explicit count or construction of more exceptional triples a + b = c with c ≤ X than the derived power-saving upper bound allows, for arbitrarily large X, would refute the claim.","tokens_in":2464,"feed_emoji":"","tokens_out":661,"duration_ms":32650,"temperature":0.7,"pith_summary":"The paper establishes a quantitative upper bound on the number of coprime natural-number triples a, b, c satisfying a + b = c that fail the prediction rad(abc) >= c^{1-ε} for fixed ε > 0. The argument proceeds by deriving upper bounds on the density of integer points lying on certain auxiliary high-dimensional varieties, using the geometry of numbers together with Fourier analysis, and these density bounds are then converted into a power-saving estimate for the exceptional set. A sympathetic reader would care because the full abc conjecture asserts only finitely many exceptions, yet this result already limits the density of any potential infinite collection of exceptions among all coprime triples. The work therefore supplies the first explicit control on the location and sparseness of possible counterexamples.","feed_headline":"Power-saving bound limits abc conjecture exceptions","feed_subtitle":"The number of coprime triples a+b=c with rad(abc) much smaller than c grows slower than the total count by a positive power.","key_machinery":"Upper bounds on the density of integer points on high-dimensional varieties, derived from the geometry of numbers and Fourier analysis.","core_discovery":"The authors prove that the exceptional set of coprime triples a, b, c with a + b = c for which rad(abc) < c^{1-ε} has size bounded by a power strictly smaller than the total number of such triples up to a given height; the power saving is obtained from upper bounds on the density of integer points on certain high-dimensional varieties that arise in the analysis and are controlled by the geometry of numbers and Fourier analysis.","pith_inferences":["Refinements of the geometry-of-numbers or Fourier-analytic exponents would immediately translate into stronger power savings or smaller θ in the exceptional-set bound.","The same point-density technique may be reusable for bounding exceptions in other Diophantine problems that involve the radical function."],"forward_implications":["The exceptional set for any fixed ε has asymptotic density zero among all coprime triples a + b = c.","Potential counterexamples to the abc conjecture are confined to a thin subset whose size grows slower than the total count by a positive power.","Any search for abc exceptions can be restricted to the arithmetic progressions or residue classes compatible with the variety point-count bounds."],"fun_headline_variants":["Power-saving bound on abc exceptional triples","Bounding abc conjecture exceptional set","Power bound for abc exceptions","Exceptional abc triples power bounded"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The upper bounds for the density of integer points on the relevant high-dimensional varieties hold with the stated exponents from the geometry of numbers and Fourier analysis.","fun_headline_variants_meta":{"raw":{"variants":["Power-saving bound on abc exceptional triples","Bounding abc conjecture exceptional set","Power bound for abc exceptions","Exceptional abc triples power bounded"]},"model":"grok-4.3","cost_usd":0.004494,"raw_usage":{"total_tokens":2183,"prompt_tokens":556,"num_sources_used":0,"completion_tokens":44,"cost_in_usd_ticks":44937000,"prompt_tokens_details":{"text_tokens":556,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1583,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":556,"tokens_out":44,"duration_ms":11095,"temperature":1.0,"reasoning_tokens":1583,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-23T19:19:44.231989+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An explicit count or construction of more exceptional triples a + b = c with c ≤ X than the derived power-saving upper bound allows, for arbitrarily large X, would refute the claim.","supporting_citations":[],"review_version":1}