Worse than square-root cancellation in Bateman-Horn's conjecture

Giacomo Bortolussi

Worse than square-root cancellation in Bateman-Horn's conjecture

T0 review · 2 major / 1 minor · reviewed 2026-07-13 · grok-4.5

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

Pith's one-line read Average error terms in Bateman–Horn’s conjecture are asymptotically larger than square-root size in the exponential range.

desk verdict Abstract-only claim of worse-than-sqrt averaged Bateman–Horn error asymptotics in the exponential range; load-bearing hypotheses uncheckable. read the letter →

arxiv 2604.02287 v2 pith:FV33BIB3 submitted 2026-04-02 math.NT

Giacomo Bortolussi This is my paper · ORCID

classification math.NT MSC 11N3211N05

keywords Bateman-Hornconjectureerrortermssquare-rootcancellationasymptoticsprimevaluesofpolynomialsexponentialrangenumbertheory

topics The Twin Prime Conjecture

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

Bateman–Horn’s conjecture predicts how often a system of polynomials takes simultaneous prime values. This paper studies the average size of the error in that prediction when the range of values is exponential. It proves an asymptotic formula for that average error and shows that the error is larger than the square-root cancellation one might expect from random-like fluctuations. If the result holds, it means that the prime-producing polynomials do not cancel as strongly as a pure square-root heuristic would suggest, at least on average in this large range. A sympathetic reader cares because the result quantifies how much “randomness” is missing from the distribution of simultaneous prime values of polynomials.

What carries the argument

The averaged Bateman–Horn error term itself—the difference between the actual count of simultaneous prime values of an admissible polynomial system and the conjectured main term—averaged with respect to a measure supported in the exponential range; the asymptotic expansion of this average is the object that carries the proof.

What would settle it

Compute or rigorously bound the averaged error for a concrete admissible system (for example two linear polynomials) over a large but finite exponential window and check whether the size matches the paper’s asymptotic main term rather than a pure square-root bound.

Watch

Extended reading notes

Core claim

The paper establishes an asymptotic formula for the average of the error term appearing in Bateman–Horn’s conjecture, taken over an exponential range of arguments; the resulting main term is strictly larger than square-root size, so the averaged error exhibits worse-than-square-root cancellation.

Load-bearing premise

The precise averaging measure, the admissible class of polynomial systems, and the exact meaning of the exponential range must all be chosen so that the claimed asymptotic formula holds; if any of those technical hypotheses fails, the formula collapses.

Editorial extensions

If this is right

On average, simultaneous prime values of polynomials deviate from the Bateman–Horn main term by more than a square-root fluctuation once the range is exponential.
Any proof of Bateman–Horn that relies on square-root cancellation of the error must fail, at least on average, in the exponential range.
Heuristic models of prime tuples that assume random-like square-root errors need an additional bias term of larger order when the range is exponential.
The same averaging technique may yield explicit secondary terms for other prime-producing conjectures in large ranges.

Reading between the lines

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

The same method might produce analogous worse-than-square-root averages for the Hardy–Littlewood tuple conjecture or for prime values of a single irreducible polynomial of higher degree.
If the averaging measure can be localized, one could test whether the large error is concentrated on a sparse set of exceptional heights or is more uniformly distributed.
An effective version of the asymptotic would give a concrete numerical threshold beyond which the excess over square-root size becomes visible in computations.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

The one thing you need to know is that we only have the abstract. It asserts asymptotics for the average error term in Bateman–Horn in the exponential range, and that those asymptotics show worse than square-root cancellation. That is the whole paper as far as we can see.

If the full argument delivers, this is a clean quantitative refinement of a central heuristic. Bateman–Horn is the natural multi-polynomial extension of Hardy–Littlewood; knowing the size of the averaged error, and learning that it is larger than the square-root barrier one might hope for, constrains what any future proof strategy can look like and sharpens the random-model picture. The claim is stated as a theorem rather than a rephrasing of something already in the literature, so the novelty looks real on its face.

The soft spot is total: without the body we cannot see the averaging measure, the admissible class of polynomials, the precise meaning of “exponential range,” or the comparison with earlier work. Those choices are load-bearing. If the average is taken against a very smooth weight, or the range is short, or the polynomials are heavily restricted, the headline interpretation weakens. Nothing in the abstract smells circular or invented; it just cannot be verified. Soundness is therefore provisional.

This is for people who already work on prime-producing polynomials, sieve methods, or the analytic side of Hardy–Littlewood-type conjectures. A reader outside that circle will get little. Inside it, the result is worth a careful look once the proofs appear. I would send it to a serious referee rather than desk-reject; the claim is important enough and the area mature enough that the paper deserves to be checked on its own terms. If the full text is as thin as the abstract, the referee will say so quickly.

Referee Report

2 major / 1 minor

Summary. The manuscript claims to prove asymptotics for the average error term appearing in Bateman–Horn’s conjecture, taken in an exponential range, and asserts that these asymptotics exhibit worse than square-root cancellation. Only the abstract is available for review; no theorems, definitions of the averaging measure or admissible polynomial systems, error-term formulae, or proofs are supplied.

Significance. If the claimed asymptotic is established under natural hypotheses on the averaging measure and on the class of polynomial systems, the result would be a genuine contribution to analytic number theory: it would show that the averaged Bateman–Horn error can exceed the square-root barrier in an exponential range, refining the expected size of fluctuations for prime values of polynomials. The claim is therefore of clear interest, but its significance cannot be assessed until the precise range, measure, and comparison with prior literature are visible.

major comments (2)

Only the abstract is available. The central claim is an asymptotic for an averaged Bateman–Horn error that is worse than square-root cancellation in an exponential range. The load-bearing ingredients—the precise averaging measure, the admissible class of polynomial systems, the exact meaning of “exponential range,” the form of the main-term and error-term formulae, and the comparison with existing bounds—are not stated in the abstract and cannot be inspected. Without them a technical evaluation of correctness is impossible.
Because the manuscript body, equations, and proofs are absent, it is impossible to verify that the argument actually produces the stated cancellation rather than a weaker or conditional statement. Any recommendation other than “uncertain” would be unfounded.

minor comments (1)

The abstract is extremely terse (one sentence). Even a short abstract should indicate the averaging measure, the range, and the shape of the asymptotic so that a reader can judge scope and novelty.

Circularity Check

0 steps flagged · score 0.0 of 10

Abstract-only review: no derivation chain or equations available to inspect for circularity.

full rationale

Only the abstract is available: 'We prove asymptotics for the average error term in Bateman-Horn's conjecture in the exponential range.' No theorems, equations, definitions of the averaging measure, admissible polynomial systems, or 'exponential range' appear, and no self-citations or fitted parameters are present. Circularity analysis requires quoting specific reductions (self-definitional identities, fitted inputs renamed as predictions, load-bearing self-citations, etc.). With no derivation chain visible, none of the six enumerated patterns can be exhibited. The claim is a standard analytic-number-theory asymptotic for an averaged error term and is expected to rest on external tools rather than on a quantity defined by the target itself. Per the hard rules, an honest non-finding is required: score 0, empty steps. The reader's provisional score of 2 and the skeptic's concerns about unstated hypotheses are correctness/load-bearing issues, not circularity.

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

Abstract-only pure-math paper. No numerical free parameters or invented physical entities appear. The claim rests on the standard axiomatic setup of Bateman–Horn (systems of irreducible integer polynomials of fixed degree, non-vanishing of the singular series) and on classical tools of analytic number theory whose precise form is not visible here.

assumptions (2)

domain assumption Bateman–Horn setup: finite systems of irreducible integer polynomials with non-vanishing singular series
The conjecture and its error term are only defined for such systems; the abstract presupposes this framework.
domain assumption Standard analytic estimates for primes in arithmetic progressions or sieve upper/lower bounds sufficient for exponential ranges
Any asymptotic for an averaged Bateman–Horn error must invoke some form of prime-number theorem or sieve technology; the abstract does not specify which.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Worse than square-root cancellation in Bateman-Horn's conjecture." pith.science (2026). https://pith.science/paper/FV33BIB3

@misc{pith2026260402287,
  author       = {Pith},
  title        = {Pith review of: Worse than square-root cancellation in Bateman-Horn's conjecture},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FV33BIB3}},
  note         = {Machine review of arXiv:2604.02287}
}

read the original abstract

We prove asymptotics for the average error term in Bateman-Horn's conjecture in the exponential range.

Discussion (0). Continue with ORCID to comment.

Pith tools

Reviewed July 13, 2026 · model on record in the stance chip above.