Effective Bounds for Singular Series in the Multivariate Bateman Horn Conjecture

Victor Volfson

REVIEW 4 major objections 3 minor 1 cited by

Effective Bounds for Singular Series in the Multivariate Bateman Horn Conjecture

T0 review · 4 major / 3 minor · reviewed 2026-08-02 · deepseek-v4-flash

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

Pith's one-line read The tail error of the Bateman–Horn singular series is controlled by Betti numbers of the polynomial's zero sets.

desk verdict Useful program, broken proof: the main estimate (3.12) has the wrong exponent, and Theorem 4 quietly switches from the Bateman–Horn singular series to the Waring singular series. read the letter →

arxiv 2604.25969 v2 pith:VK4UUTUC submitted 2026-04-28 math.NT

Victor Volfson This is my paper · ORCID

classification math.NT MSC 11N3211P5511G2511T23

keywords Bateman–HornconjecturesingularserieslocaldensitiesBettinumbersweighttheoremdiagonalformscirclemethodrelativeerrorbounds

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

This paper sets out to make the infinite product defining the singular series in the multivariate Bateman–Horn conjecture computable with certified accuracy. It claims that if a polynomial system satisfies the paper's smoothness conditions (BH1–BH4), then truncating the product at primes p≤P produces a relative error no larger than an explicit constant times P^{-(m-1)/2}, with the constant determined by Betti numbers of the projective closures of the zero sets. For diagonal polynomial forms the exponent improves to P^{-m/2}, which the paper shows translates into several orders of magnitude of extra accuracy at the same truncation point. A sympathetic reader should care because the singular series is the leading constant in the conjectured prime-counting asymptotic, and until now its tail had no quantitative control.

What carries the argument

The engine of the proof is the transformation of the local factor L_p(F) into a cohomological trace. For each non-empty subset of the polynomials, the number of points on the relevant hypersurface modulo p is written via the trace formula; the weight theorem then bounds Frobenius eigenvalues, and inclusion-exclusion over intersections isolates the leading term so that the deviation |L_p(F)−1| is bounded by a Betti-number sum times p^{-(m+1)/2}. In the diagonal case an exact formula for diagonal cohomologies and the factorization of exponential sums replace the general geometric constant by a smaller one and improve the exponent to p^{-(1+m/2)}; circle-method mean-value estimates are used to

What would settle it

Take an irreducible polynomial whose projective closure has a singularity at infinity, for example F(x,y)=x^3+y^3+x^2 y, and compute the local factors L_p(F) for primes p up to a few thousand from the solution counts of F≡0 mod p. If |L_p−1| is not bounded by any constant times p^{-(m+1)/2} (here p^{-3/2}), then the BH4 smoothness assumption is load-bearing for Theorem 1. For a direct check of Theorem 4, compute L_p for the diagonal cubic x^3+y^3+z^3 and test the claimed local bound |L_p−1| ≤ B_diag p^{-5/2}; a single prime violating that bound would overturn the diagonal tail estimate.

Watch

Extended reading notes

Core claim

The central claim, stated as Theorem 2, is that for a system F=(F_1,...,F_k) of integer polynomials in m variables satisfying BH1–BH4, the relative error in replacing the singular series C_F by the truncated product C_F(P) over primes p≤P satisfies |C_F−C_F(P)|/C_F ≤ 4B(F)/(m−1)·P^{-(m-1)/2}. The constant B(F) is the sum of Betti numbers of all intersections of the projective closures of F_i=0 and of their sections by the hyperplane at infinity. Theorem 4 gives the diagonal-form analogue |S−S_P|/S ≤ 8B_diag/(m−1)·P^{-m/2}, where B_diag comes from an exact diagonal-cohomology formula. Theorem 3 makes the general result constructive for a single smooth polynomial by bounding B(F) explicitly in

Load-bearing premise

The paper assumes, in condition BH4 stated in Section 3, that the projective closures of F_i=0 and all their intersections are smooth (or have controlled singularities), so that one Betti-number sum uniformly controls the Frobenius trace at every prime; this is not proved, and it fails for many ordinary irreducible polynomials whose projective closure is singular at infinity.

Editorial extensions

If this is right

Given a target relative error ε, the general bound prescribes a finite sieving depth: P roughly (4B(F)/((m−1)ε))^{2/(m−1)} succeeds.
For diagonal forms the same prescription uses exponent 2/m on P, so the number of primes needed for a fixed accuracy is dramatically smaller; the paper's tables show gains of one to three orders of magnitude in the bound at P=10^2.
For a single smooth polynomial, Theorem 3 removes the need for a per-polynomial cohomology computation: m and degree alone determine a certified truncation level.
The tail-control results do not prove the Bateman–Horn asymptotic, but they isolate the singular series as a component whose numerical evaluation is no longer a barrier.

Reading between the lines

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

The smoothness condition BH4 is likely the practical bottleneck: generic irreducible polynomials often have singular points at infinity, so a useful next step is to test whether the same tail bound survives after resolving those singularities and using the resolved Betti numbers.
The gap between the general exponent (m−1)/2 and the diagonal exponent m/2 suggests a spectrum: polynomials with intermediate symmetry, such as sums of powers grouped in blocks, may exhibit intermediate decay rates; computing local factors for such families would test this.
The paper's numerical tables compare upper bounds, not actual errors; computing exact truncated products for the sample polynomials would show how loose the bounds are and could motivate tighter constants via Newton polytopes or mixed Hodge structure.

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 paper's program is genuinely useful: control the tail of the Bateman–Horn singular series by Betti numbers, with explicit constants. That is not in the cited literature, and it would be worth having if done correctly. The comparison between the general bound and the diagonal bound is also a nice idea, and the tables make the practical point clearly.

But the proof has two load-bearing problems. First, Theorem 1's key estimate (3.12) is asserted via reference with the exponent d−1/2, which is too weak to imply the claimed P^{−(m−1)/2} tail after summation over primes. The subsequent derivation silently needs p^{d/2}. This may be a typo, but as written it is a gap that invalidates Theorem 2 as stated.

Second, and more serious, Theorem 4 changes objects. The Bateman–Horn local factor L_p(F) counts affine zeros of F mod p, while the estimate quoted from Katz bounds σ_p(N), the p-adic density for the equation F(x)=N. The paper never proves these have the same tail behavior. For diagonal homogeneous forms, the projective closure is singular at the origin, so the smoothness assumption of BH4 is not even available. The advertised P^{−m/2} improvement is a theorem about the Waring singular series, not about the Bateman–Horn product. That is not a minor gap; it is a different statement.

There are also smaller issues: BH4 is assumed rather than proved, and for general irreducible polynomials the projective closure is often singular at infinity, so the uniform local bound in Theorem 1 is not justified. The text is heavily garbled, but the structural problems are independent of formatting.

Who is this for? A reader who wants to understand the strategy of using Deligne weights to estimate singular series tails might find the first three sections worth skimming. But the actual estimates cannot be cited. The paper needs a major rewrite, with a correct proof or explicit statement of (3.12), and a honest treatment of the diagonal case. As it stands, I would not send it to peer review; I would return it for proof of concept first.

Referee Report

4 major / 3 minor

Summary. The paper addresses the quantitative computation of the singular series constant in the multivariate Bateman–Horn conjecture. Section 2 derives the local-factor product heuristically and gives a worked example. Section 3 states and proves a general uniform bound for local factors under conditions BH1–BH4 (Theorem 1), derives a tail bound for the truncated singular product (Theorem 2), and gives an explicit Betti-number bound for a single smooth polynomial (Theorem 3). Section 4 treats diagonal forms: it claims a faster P^{-m/2} tail (Theorem 4) using Katz's exact diagonal cohomology formula and a Hardy–Littlewood/circle-method discussion. The paper closes with tables comparing universal and diagonal constants and error estimates.

Significance. If the results were correct, the paper would provide a useful, geometry-dependent stopping criterion for numerical evaluation of Bateman–Horn constants, and the diagonal improvement would be a genuine quantitative gain. The idea of packaging Deligne's weight theorem into a Betti-number constant is attractive, and the paper is explicit about the dependence on dimension and degree. However, the proof of the general estimate contains a displayed exponent that does not imply the theorem's stated rate, and the diagonal section proves a statement about a different singular series with no transfer to the Bateman–Horn local factors. The advertised central claims are therefore not established as written.

major comments (4)

[§3, Eq. (3.12)–(3.17)] Equation (3.12) states |N(V_I) - p^{d_I}| ≤ B p^{d_I - 1/2}. Taken literally, for |I| = 1 this gives an error of order p^{m-3/2} after division by p^m, i.e. only O(p^{-3/2}) in (3.17), whereas Theorem 1 claims O(p^{-(m+1)/2}); for m ≥ 3 these rates are different. The conclusion (3.16) would require a Deligne-type bound with exponent d_I/2, not d_I - 1/2. Thus the proof of Theorem 1, and consequently Theorem 2, does not establish the stated rates.
[§4, Theorem 4 and Eq. (4.4)–(4.7)] The object S(N) = ∏_p σ_p(N), with σ_p(N) = lim_{r→∞} p^{-(m-1)r} #{x mod p^r : F(x) ≡ N}, is the Waring-type singular series for the equation F(x) = N, not the Bateman–Horn constant C(F) = ∏_p L_p(F) from (3.6)–(3.7). No identification or inequality relating σ_p(N) - 1 to L_p(F) - 1 is supplied. Katz's estimate (4.4) therefore cannot be substituted into the BH product. Concretely, for m = 3 and F = x_1^3 + x_2^3 + x_3^3, the claimed P^{-3/2} tail after summing primes would require |L_p - 1| ≪ p^{-5/2}, whereas the Weil bound for the projective cubic curve gives only |L_p - 1| ≪ p^{-3/2}. The advertised diagonal improvement for the BH singular product is unsupported.
[§3, BH4 and proof of Theorem 1] The uniformity over all primes in (3.9) rests on condition BH4, stated only as 'smooth or have controlled singularities'. For a general integer polynomial the projective closure is often singular or singular at infinity, and the paper gives no definition of 'controlled singularities' and no proof that the Betti-number sum controls Frobenius traces at such primes. The derivation (3.11)–(3.13) uses Deligne's weight theorem in its smooth-variety form; bad primes need a separate argument, e.g. an explicit resolution with weight bounds. As written, the estimate is a hypothesis in disguise rather than a theorem about integer polynomials satisfying checkable conditions.
[§4, circle-method discussion] The circle-method material in Section 4 is not used in the proof of Theorem 4: after quoting minor-arc estimates and thresholds from [12], the proof of (4.7) uses only (4.4) and Abel summation. The abstract's claim that an 'additional application of the Hardy–Littlewood circle method allows us to further refine the estimate' is therefore not substantiated by any theorem or proof in the paper. The tables appear to mix two different bounds depending on m ≥ k(k+1)/2, but no statement formalizes this.

minor comments (3)

[§3, Eq. (3.14)] Equation (3.14) is badly typeset with mismatched parentheses; the displayed line should be rewritten. Also 'Batman–Horn' in Section 1 is a typo for 'Bateman–Horn'.
[§4, Table 3] The values of B_diag(m,n) computed from (4.1) are not integers and are not literally Betti numbers. The relation between B_diag and the Betti-sum constant B(F) used earlier should be explained; as printed, the table can be misread as comparing topological Betti numbers.
[§4, Tables 4–5] The tables should state explicitly which theorem's bound is being evaluated in each row. For m = 3, k = 3 the diagonal threshold is not satisfied, so the row uses the general bound, but the column heading 'diag ε' makes the comparison confusing.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the central estimates are derived from external cohomological theorems with geometric constants, not from fitted outputs or self-citations.

full rationale

I walked the derivation chain. Theorem 1's local-factor bound is derived from Deligne's weight theorem, the Grothendieck-Lefschetz formula, and Katz [7], with B(F) defined as a sum of Betti numbers rather than fitted to the tail being predicted. BH4 is explicitly an assumption ('so that Deligne estimates work'), and any failure of that smoothness condition is a limitation, not a hidden circular input. Theorem 2 is a summation consequence of Theorem 1, and Theorem 3 bounds B(F) using an external Betti-number estimate [9]. The paper contains no self-citations, so the self-citation-based circularity patterns do not apply. The only candidate concern is Theorem 4: it quotes Katz's estimate (4.4) for the local density σ_p(N) of the diagonal equation F(x)=N and then sums it to obtain the tail bound. That is a direct corollary of an external, independent result, not a circular reduction. A separate validity issue, which is not circularity, is that Section 4 changes the singular series from the Bateman-Horn product ∏L_p(F) to the Waring singular series ∏σ_p(N) without proving the local factors coincide. Consequently, there is no fitted input masquerading as a prediction and no load-bearing self-citation; the honest finding is no significant circularity.

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

The paper introduces no new physical or mathematical entities. Its free parameters are replaced by geometric constants B(F) and B_diag that are not fitted but also not explicitly computed for general systems. The main load-bearing inputs are Deligne's theorem, the trace formula, and Katz's diagonal estimates.

assumptions (6)

standard math Deligne's weight theorem for Frobenius eigenvalues on ℓ-adic cohomology.
Invoked in the proof of Theorem 1 to bound the error terms in (3.12)-(3.13).
standard math Grothendieck–Lefschetz trace formula for point counts over finite fields.
Equation (3.11) expresses N_V(p) as an alternating trace of Frobenius.
domain assumption Smoothness or controlled singularities of all projective closures V_I and V_I∩H∞.
Condition (BH4) is assumed in Theorem 1; no effective criterion is given for a given polynomial system.
domain assumption Katz's estimate (4.4) for local densities of diagonal non-degenerate forms.
Theorem 4's proof rests entirely on this cited estimate; it is not rederived and its relation to the Bateman–Horn local factor is not shown.
domain assumption Katz's exact formula (4.1) for diagonal cohomology dimensions.
Used to define B_diag in Theorem 4; the formula is cited from [10] rather than proved.
standard math Neglect of quadratic terms in the expansion of log(1+δ_p).
Used in Theorem 2's proof; justified only for sufficiently large P and small deviations.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Effective Bounds for Singular Series in the Multivariate Bateman Horn Conjecture." pith.science (2026). https://pith.science/paper/VK4UUTUC

@misc{pith2026260425969,
  author       = {Pith},
  title        = {Pith review of: Effective Bounds for Singular Series in the Multivariate Bateman Horn Conjecture},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VK4UUTUC}},
  note         = {Machine review of arXiv:2604.25969}
}

read the original abstract

We propose an approach to estimating the error in computing the singular series in the multivariate Bateman Horn conjecture, based on a combination of methods from algebraic geometry and analytic number theory. For general polynomial systems, we establish a uniform estimate in primes for the local factors, from which we derive a universal upper bound for the relative error expressed in terms of a geometric constant depending on the Betti numbers of the projective closures of the hypersurfaces. For a single polynomial, an explicit bound for this constant is given in terms of the degree and the number of variables, making the result constructive. In the diagonal case, using Katz exact formula for diagonal cohomologies, we obtain substantially faster convergence; an additional application of the Hardy Littlewood circle method allows us to further refine the estimate. Numerical examples show that diagonal systems yield an accuracy gain of several orders of magnitude compared with the general case. Our results provide rigorous quantitative error control and demonstrate that the convergence rate is determined not only by the degree but also by the geometric structure of the polynomial system.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Estimating the tail of the singular product for the Hardy Littlewood and Bateman Horn conjectures
math.GM 2026-06 unverdicted novelty 5.0 of 10

A universal estimate shows the singular product tail for Hardy-Littlewood and Bateman-Horn conjectures decays as 1/log regardless of system structure, with superfast convergence for linear cases and Galois-averaged co...

Reference graph

Works this paper leans on

12 extracted references · 1 linked inside Pith · cited by 1 Pith paper

[12]

T., Prendiville, S

Parsell, S. T., Prendiville, S. M. & Wooley, T. D. (2020). Near-optimal mean value estimates for multidimensional Weyl sums. Geometric and Functional Analysis, 30(2), 421–487

2020
[1]

Prime Number Theorems for Polynomials from Homogeneous Dynamics

Giorgos Kotsovolis, Katharine Woo (2023). Prime Number Theorems for Polynomials from Homogeneous Dynamics. Preprint. https://arxiv.org/abs/2312.11445 [math.NT]

arXiv 2023
[2]

& Sofos, E

Destagnol, K. & Sofos, E. (2019). The Bateman–Horn conjecture for polynomials in many variables. Mathematische Annalen, 374(1–2), 1–35

2019
[3]

& Wooley, T

Brüdern, J. & Wooley, T. D. (2022). The Bateman–Horn conjecture for diagonal polynomials. Journal für die reine und angewandte Mathematik (Crelle’s Journal), 2022(789), 1–45

2022
[4]

D., Sofos, E

Browning, T. D., Sofos, E. & Teräväinen, J. (2022). The Bateman–Horn conjecture for almost all polynomials. Duke Mathematical Journal, 171(15), 3051–3112

2022
[5]

& Wang, Z

Matthiesen, L., Teräväinen, J. & Wang, Z. (2024). Polynomial patterns in the primes and the Bateman–Horn conjecture. Inventiones mathematicae, 235(3), 891–950

2024
[6]

Deligne, P. (1980). La conjecture de Weil. II. Publications Mathématiques de l'IHÉS, 52, 137–252

1980
[7]

Katz, N. M. (1980). Sommes exponentielles. Astérisque, 79. Société Mathématique de France

1980

Show all 12 references

[8]

Grothendieck, A. (1977). Formule de Lefschetz et rationalité des fonctions L. In Séminaire de Géométrie Algébrique du Bois-Marie (SGA 5). Lecture Notes in Mathematics, Vol. 589. Springer-Verlag

1977
[9]

Dimca, A. (1992). Singularities and Topology of Hypersurfaces. Universitext. Springer-Verlag, New York. ISBN: 978-0-387-97709-5

1992
[10]

Katz, N. M. (1988). Gauss sums, Kloosterman sums, and monodromy groups. Annals of Mathematics Studies, No. 116. Princeton University Press

1988
[11]

Vaughan, R. C. (1997). The Hardy–Littlewood Method (2nd ed.). Cambridge Tracts in Mathematics, No. 125. Cambridge University Press

1997

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.

[1] [12]

T., Prendiville, S

Parsell, S. T., Prendiville, S. M. & Wooley, T. D. (2020). Near-optimal mean value estimates for multidimensional Weyl sums. Geometric and Functional Analysis, 30(2), 421–487

2020

[2] [1]

Prime Number Theorems for Polynomials from Homogeneous Dynamics

Giorgos Kotsovolis, Katharine Woo (2023). Prime Number Theorems for Polynomials from Homogeneous Dynamics. Preprint. https://arxiv.org/abs/2312.11445 [math.NT]

arXiv 2023

[3] [2]

& Sofos, E

Destagnol, K. & Sofos, E. (2019). The Bateman–Horn conjecture for polynomials in many variables. Mathematische Annalen, 374(1–2), 1–35

2019

[4] [3]

& Wooley, T

Brüdern, J. & Wooley, T. D. (2022). The Bateman–Horn conjecture for diagonal polynomials. Journal für die reine und angewandte Mathematik (Crelle’s Journal), 2022(789), 1–45

2022

[5] [4]

D., Sofos, E

Browning, T. D., Sofos, E. & Teräväinen, J. (2022). The Bateman–Horn conjecture for almost all polynomials. Duke Mathematical Journal, 171(15), 3051–3112

2022

[6] [5]

& Wang, Z

Matthiesen, L., Teräväinen, J. & Wang, Z. (2024). Polynomial patterns in the primes and the Bateman–Horn conjecture. Inventiones mathematicae, 235(3), 891–950

2024

[7] [6]

Deligne, P. (1980). La conjecture de Weil. II. Publications Mathématiques de l'IHÉS, 52, 137–252

1980

[8] [7]

Katz, N. M. (1980). Sommes exponentielles. Astérisque, 79. Société Mathématique de France

1980