{"id":"be89b4f3-f15c-422b-80ac-4c0cbedffdf9","arxiv_id":"1908.09491","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"In each critical strip of a normalized exponential sum, the number of zeros in a rectangle of height r is asymptotically |w_j - w_k| r/(2π), up to an O(1) error.","lead":"This paper counts the zeros of normalized exponential sums inside each individual critical strip, giving an asymptotic formula |w_j - w_k| r/(2π) + O(1) for the number of zeros in a rectangle of height r. It fills a gap left by Langer's 1931 count for the union of all strips and complements Moreno's density result with a measure-zero statement about vertical lines.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Step-function extension in §4 needs a uniform jump bound; without it the O(1) statement for all rectangles is not justified.","rationale":"The reader's weakest_assumption points to uniformity of the dominance margin in §4. That margin, however, is not the real soft spot: the vertical sides x1 and x2 are fixed inside zero-free regions, the strict inequality (2.1) does not involve y, and the resulting positive lower bound on |f(x+iy)| is automatically uniform in y. The Backlund-lemma estimates and the vertical-side asymptotics then hold with O(1) constants independent of r. The genuinely missing justification is at the end of §4, where the proof passes from the generic case (no zeros on horizontal sides) to all rectangles. A step function can have arbitrarily large jumps, and without a uniform bound on those jumps the stated O(1) error need not survive. The needed bound follows from the classical Descartes rule for real exponential polynomials applied to Re f(x+iy), which has n+1 real coefficients and hence at most n zeros. This is a small but real gap in exposition, not a flaw in the theorem's substance. The Backlund lemma proof, the argument-principle setup, and the example corollary all check out independently, so the reader's CONDITIONAL verdict remains appropriate.","tokens_in":8065,"tokens_out":39955,"duration_ms":432518,"concrete_test":"Add to §4 the Descartes-rule observation: for fixed y, write Re f(x+iy)=Σ_{j=0}^n Re(H_j e^{iw_j y}) e^{w_j x}; its coefficient sequence has at most n sign changes, so it has at most n real zeros in x∈[x1,x2]. Then rederive the extension: for any y1, compare with nearby generic lines y1±ε; the count difference is at most n, so the O(1) constant in (2.4) is preserved for all rectangles. A numerical check on a representative f, e.g. 1+e^z+e^{2z}, can confirm that every horizontal line meets at most 2 zeros in the critical strip.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 4 proves (2.4) only after excluding countably many y1 and countably many r for which a horizontal side of the rectangle contains a zero. The final sentence of §4 asserts that the formula extends to all rectangles because the counting functions are step functions, but this is not by itself sufficient: the O(1) constant survives the extension only if the jumps of the counting function are uniformly bounded. The paper never proves that a horizontal line Im(z)=y can meet only a bounded number of zeros inside the fixed vertical interval [x1,x2]. This matters because Theorem 2.1 is stated for every rectangle. The gap is patchable: for fixed y, Re f(x+iy) is a real exponential polynomial in x with exponents 0<w1<...<wn, so Descartes' rule for exponential sums gives at most n real zeros (and similarly for Im f, or if Re f vanishes identically). Hence any horizontal line contributes at most n zeros, so every jump is O(1). With that bound, the step-function extension is immediate. As written, the proof omits this necessary justification, though the underlying claim appears true.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies normalized exponential sums f(z)=1+H_1 e^{w_1 z}+...+H_n e^{w_n z} with 0<w_1<...<w_n. Its main result, Theorem 2.1, states that all zeros lie in finitely many vertical critical strips and that for any rectangle R cut from a critical strip Lambda(j,k) by two horizontal lines at distance r, the number of zeros satisfies n(r,Lambda_{jk})=|w_j-w_k| r/(2 pi)+O(1). The proof uses the argument principle: vertical sides are placed in adjacent zero-free regions where one exponential term dominates, yielding the linear main term, while Backlund's lemma is used to bound the contributions of the horizontal sides by O(1). The paper also proves a measure-zero counterpart to Moreno's density result: almost every vertical line meets at most finitely many of the small discs centered at the zeros with radius r_n=(1+|z_n|)^{-1} log^{-2}(e+|z_n|).","tokens_in":8222,"tokens_out":9567,"duration_ms":93507,"significance":"If the main theorem is correct, it sharpens Langer's global estimate by giving the asymptotic count in each individual critical strip rather than in one wide strip, with an explicit O(1) error and a clean dependence on the difference of the adjacent dominating frequencies. The proof is self-contained and includes a full proof of Backlund's lemma, which is a useful expository addition. The measure-zero disc result is a nice quantitative counterpart to Moreno's theorem and does not require rational independence of the frequencies. The main formula is explicit and testable, for instance on the example f(z)=6-5e^z+e^{2z}, where it recovers the correct vertical spacing of zeros. However, the proof of the step-function extension at the end of Section 4 is incomplete, and the geometry stated in Theorem 2.1 does not exactly match the contour used in the proof; both issues are local and repairable.","major_comments":[{"comment":"The extension from the exceptional set to all rectangles is not justified as written. Up to the final paragraph, (2.4) is proved only for those y1 and r for which the horizontal sides Gamma1 and Gamma3 contain no zeros. The sentence that 'all counting functions are step functions' only yields the extension if the jumps of the counting function n(r,Lambda_{jk}) when a horizontal line crosses a zero are uniformly bounded, and no such bound is given. This is load-bearing because Theorem 2.1 asserts the O(1) estimate for every rectangle. The gap is repairable: for each fixed y, Re f(x+iy) is a real exponential polynomial in x with at most n+1 terms, so by the standard Descartes rule for exponential sums with real exponents it has at most n real zeros, and the same holds for Im f (or Im f vanishes identically, in which case the real part controls the zeros). Hence every horizontal line contains O(1) zeros and all jumps of the counting function are O(1). This argument should be incorporated explicitly, and the phrase 'piecewise continuity' should be corrected to 'piecewise constant with uniformly bounded jumps'.","section":"Section 4, final paragraph"},{"comment":"The statement of Theorem 2.1 and the proof use different rectangles. The theorem says R is a rectangle cut from the critical strip Lambda(j,k) by two horizontal lines, while the proof places the vertical sides at x1 and x2 lying in the middle of the two adjacent zero-free regions. Since zero-free regions contain no zeros, the count in the larger rectangle equals the count in the closed portion of the critical strip, but this identification is never stated. If R is intended to have vertical sides on the boundary lines of Lambda(j,k), the proof should say explicitly that zeros on those boundary lines are included in the count and that the contour is placed away from them; if R is intended to have vertical sides inside the adjacent zero-free regions, the theorem should say so. As written, the geometry of the rectangle is ambiguous and the argument-principle contour does not correspond literally to the rectangle in the statement.","section":"Theorem 2.1 and Section 4"}],"minor_comments":[{"comment":"The word 'sayhing' should be 'saying'.","section":"Introduction, page 3"},{"comment":"The notation 'F(z)=F(z)' in the paragraph after the Taylor expansion is not meaningful in the text; it should be written as an overline or as \\overline{F(\\bar z)} to indicate the entire function used in the symmetry argument.","section":"Section 3, Backlund's lemma proof"},{"comment":"The notation for the largest frequency is inconsistent: the introduction uses w_m, while Theorem 2.1 uses w_n. The authors should unify this notation.","section":"Equations (1.3) and (1.4), and Theorem 2.1"},{"comment":"The Riemann-Stieltjes estimate leading to the factor 3 in the bound is not explained; a one-line justification via integration by parts would improve readability.","section":"Example 3"}],"recommendation":"major_revision","confidential_remarks":"This is a solid and interesting paper, and the main asymptotic formula appears to be correct. The two major issues identified are local and patchable: the step-function extension needs a uniform jump bound, and the rectangle geometry in the theorem should be aligned with the proof. I recommend major revision rather than rejection. The authors may also want to check whether recent literature on exponential polynomials contains related per-strip counting results that should be cited."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Worth your eyes: this paper fills a real gap. Langer counted zeros of normalized exponential sums in the union of all critical strips; Moreno gave density statements. Heittokangas and Wen add the missing per-strip count: for a rectangle of height r cut from a critical strip Λ(j,k), the number of zeros is |w_j - w_k| r/(2π) + O(1). That's new, and it's the natural completion of the classical picture.\n\nThe proof is built on the argument principle. Vertical sides sit inside zero-free regions, where one term dominates, so they produce the linear terms. Horizontal sides are handled with Backlund's lemma, and the paper gives a complete proof of the lemma itself. That's a service: Schwengeler's original is hard to follow. The calculation is straightforward once the lemma is in hand. I checked the algebra and didn't find any circularity or hidden assumptions beyond the natural ones. The result in Example 3, that almost every vertical line meets at most finitely many small discs around zeros, is a nice counterpart to Moreno.\n\nThe one soft spot is the last paragraph of Section 4. The formula is proved for all but countably many choices of the horizontal lines, where no zero lies on the boundary. The paper then says the formula extends to all rectangles because the counting functions are step functions. That claim needs an extra justification: a step function can have arbitrarily large jumps. To make the O(1) constant survive, you need a uniform bound on how many zeros lie on any given horizontal segment. That bound exists and is easy: for fixed y, Re f(x+iy) and Im f(x+iy) are real exponential polynomials in x with n exponents, so each has at most n zeros by the Descartes rule for exponential sums. Hence every horizontal side crosses at most 2n zeros, and the jumps are uniformly bounded. This is a minor patch, not a defect in the main argument. There's also a small typo in the introduction (w_m where w_n is meant), but nothing that confuses.\n\nBottom line: the central theorem is correct and the proof is essentially complete. The paper deserves a serious referee, and a short revision would make it fully rigorous. If you work on value distribution or exponential polynomials, cite it.","headline":"The per-strip zero count for exponential sums is genuinely new and the proof is sound; one small gap in the step-function extension needs a patch, but it's an easy one.","tokens_in":8771,"tokens_out":4355,"would_cite":true,"duration_ms":42947,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["30D20","30D35"],"pacs":[],"model":"deepseek-v4-flash","headline":"In a normalized exponential sum, the zeros in each individual critical strip obey the linear asymptotic $|w_j-w_k|r/(2\\pi)+O(1)$, refining the older whole-strip estimate.","keywords":["exponential sums","zero distribution","critical strips","zero-free regions","argument principle","asymptotic counting","entire functions"],"falsifier":"Take the factorized example $f(z)=6-5e^z+e^{2z}$, whose zeros lie exactly on the vertical lines $\\operatorname{Re}z=\\log 2$ and $\\operatorname{Re}z=\\log 3$; in the critical strip $\\{0\\le\\operatorname{Re}z\\le\\log 2\\}$, rectangles of height $r$ should contain $r/(2\\pi)+O(1)$ zeros. Directly counting the zeros for $r=10^3,10^4,\\dots$ either keeps the correction bounded or refutes the theorem.","tokens_in":7839,"feed_emoji":"📈","tokens_out":9536,"duration_ms":95674,"temperature":0.7,"pith_summary":"An exponential sum is a finite sum of exponentials, here normalized as $f(z)=1+H_1e^{w_1z}+\\cdots+H_ne^{w_nz}$ with $0<w_1<\\cdots<w_n$. This paper establishes that the zeros of such a function do not just lie in finitely many vertical strips, as known earlier; each strip has its own asymptotic zero count. For any rectangle of height $r$ cut from the critical strip $\\Lambda(j,k)$ (the closed vertical band between the zero-free regions dominated by the $j$-th and $k$-th terms), the number of zeros is $|w_j-w_k|r/(2\\pi)+O(1)$. Since the frequency difference can be read directly from the exponents, this gives a concrete, parameter-free prediction for how densely the zeros are distributed in each strip. The paper also shows that almost every vertical line meets only finitely many of the small discs centered at the zeros, a counterpart to earlier results showing zeros are dense across the strips.","feed_headline":"Each critical strip holds a predictable number of zeros","feed_subtitle":"In a rectangle of height r, the count is |w_j−w_k| r/(2π) plus a bounded error.","key_machinery":"The argument runs through the argument principle on a rectangle whose vertical sides sit deep inside two adjacent zero-free regions, where one exponential term dominates all others. The logarithmic derivative $f'/f$ on the vertical sides is asymptotic to the dominating frequency, giving the linear term $w_k r/(2\\pi)$ on one side and $-w_j r/(2\\pi)$ on the other. On the horizontal sides, the change of argument is controlled by a classical lemma (originally devised for zeta-function zero counting) that bounds the real part of the logarithmic-derivative integral along a zero-free segment by the logarithmic growth of $f$; this yields the $O(1)$ contribution. The lemma is proved in full inside the paper, and the rectangle is chosen so that $f$ has no zeros on its boundary.","core_discovery":"The central discovery is a per-strip refinement of the classical whole-strip counting result. The paper proves Theorem 2.1: all zeros of $f$ lie in finitely many critical strips $\\Lambda(j,k)$, and if $R$ is a rectangle obtained by cutting $\\Lambda(j,k)$ with two horizontal lines $y_2-y_1=r>0$, then $n(r,\\Lambda_{jk})=|w_j-w_k|r/(2\\pi)+O(1)$. The error term is bounded independently of $r$, so the average vertical density of zeros in that strip is exactly $|w_j-w_k|/(2\\pi)$. In addition, the almost-everywhere statement in Example 3 says that, with zeros $z_n$ listed by increasing modulus and discs of radius $r_n=(1+|z_n|)^{-1}\\log^{-2}(e+|z_n|)$, the set of real $c$ whose vertical line $\\operatorname{Re}z=c$ meets infinitely many of these discs has linear measure zero.","pith_inferences":["The proof's only structural input is a uniform dominance margin on the vertical sides; a natural test is whether the same per-strip formula persists for exponential sums with slowly varying polynomial coefficients, where the strips are replaced by logarithmic strips.","The radius $r_n=(1+|z_n|)^{-1}\\log^{-2}(e+|z_n|)$ is one member of a family of summable radii; any $r_n$ with $\\sum r_n<\\infty$ would yield the same almost-everywhere conclusion, so the logarithmic power is not special.","The $O(1)$ term is not identified; a numerical experiment across many $r$ could reveal whether the correction is bounded oscillation or has a limiting distribution, which the theorem does not address."],"forward_implications":["The strip count gives the asymptotic density of zeros along every vertical line inside a critical strip: roughly $|w_j-w_k|/(2\\pi)$ zeros per unit height.","A one-unit vertical shift of the counting rectangle adds about $|w_j-w_k|/(2\\pi)$ zeros as $r\\to\\infty$, a precise version of the number of new zeros per unit height.","The almost-every-line disc result strengthens the density statement: although the zero set may be dense in each strip, a typical vertical line misses all but finitely many of the small zero-centered discs.","Because the theorem holds for every individual strip, the sum of the per-strip counts is consistent with the older global count for the whole strip system."],"supporting_citations":[{"why":"Supplies the lemma, originally used to count zeros of the zeta function, that controls the horizontal sides of the counting rectangle.","marker":"[1]"},{"why":"States the dense-zero-line theorem that the almost-every-line disc result complements.","marker":"[5]"},{"why":"Gives the whole-strip counting bound that the per-strip formula refines.","marker":"[6]"},{"why":"Contains an earlier, less detailed proof of the lemma, which this paper rewrites completely.","marker":"[9]"},{"why":"Shows the zeros lie in a vertical strip, the geometric starting point for defining critical strips.","marker":"[10]"},{"why":"Gives an earlier estimate for the number of zeros in a rectangle with vertical boundary, the direct predecessor of the present count.","marker":"[11]"}],"fun_headline_variants":["Per-strip zero density is exactly |w_j-w_k|/(2π)","Each critical strip has a fixed zero density","Almost every vertical line meets finitely many zero discs","Zeros per strip: density |w_j-w_k|/(2π), error O(1)","Exponential sums: exact per-strip zero distribution"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof needs the rectangle's vertical sides to lie strictly inside zero-free regions, where a single exponential term is larger than the sum of all the others by a margin that stays bounded away from zero as $y$ varies; if a side is placed on a boundary line or too close to a zero, the $O(1)$ control on the horizontal integrals can fail.","fun_headline_variants_meta":{"raw":{"variants":["Per-strip zero density is exactly |w_j-w_k|/(2π)","Each critical strip has a fixed zero density","Almost every vertical line meets finitely many zero discs","Zeros per strip: density |w_j-w_k|/(2π), error O(1)","Exponential sums: exact per-strip zero distribution"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000541,"raw_usage":{"total_tokens":2599,"prompt_tokens":956,"completion_tokens":1643,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":572,"completion_tokens_details":{"reasoning_tokens":1553}},"tokens_in":572,"tokens_out":1643,"duration_ms":13961,"temperature":1.0,"reasoning_tokens":1553,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:10:52.388936+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the factorized example $f(z)=6-5e^z+e^{2z}$, whose zeros lie exactly on the vertical lines $\\operatorname{Re}z=\\log 2$ and $\\operatorname{Re}z=\\log 3$; in the critical strip $\\{0\\le\\operatorname{Re}z\\le\\log 2\\}$, rectangles of height $r$ should contain $r/(2\\pi)+O(1)$ zeros. Directly counting the zeros for $r=10^3,10^4,\\dots$ either keeps the correction bounded or refutes the theorem.","supporting_citations":[{"cited_title":"J., Sur les z´ eros de la fonctionζ(s) de Riemann","cited_arxiv_id":null,"evidence_quote":"Supplies the lemma, originally used to count zeros of the zeta function, that controls the horizontal sides of the counting rectangle."},{"cited_title":"J., The zeros of exponential polynomials","cited_arxiv_id":null,"evidence_quote":"States the dense-zero-line theorem that the almost-every-line disc result complements."},{"cited_title":"E., On the zeros of exponential sums and integrals","cited_arxiv_id":null,"evidence_quote":"Gives the whole-strip counting bound that the per-strip formula refines."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Contains an earlier, less detailed proof of the lemma, which this paper rewrites completely."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Shows the zeros lie in a vertical strip, the geometric starting point for defining critical strips."},{"cited_title":"E., Expansion problems of ordinary linear differen- tial equations with auxiliary conditions at more than two points","cited_arxiv_id":null,"evidence_quote":"Gives an earlier estimate for the number of zeros in a rectangle with vertical boundary, the direct predecessor of the present count."}],"review_version":1}