arXiv:2609.20727v2
Abstract
Motivated by questions and results of Erdős, Sárközy and Sós (1989), and Khalfalah and Szemerédi (2006), we introduce an ergodic approach to additive problems concerning solutions of equations of the form where is a sufficiently regular function, such as a polynomial or a logarithmico-exponential function of polynomial growth (e.g. ), and is either a given set of positive upper density, or a cell of a prescribed finite partition of . We give a complete description of the Hardy field functions of polynomial growth for which these partition and density problems are always solvable. The ergodic approach also applies to the more general problem of finding , where are two given sets of positive density. This in turn allows us to treat equations of the form , where . Some of our results also hold true when is a subset of the primes with positive relative upper density.
AI-generated audit
Audit summary
Not a correctness certificate. A green “no issues found” result may include yellow suspected typos or minor formal issues that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.
Current report
Detailed mathematical audit
01Statements2 reported findingsNo statement issues found
The Ramsey, density, uniform ergodic, quantitative, prime-set, obstruction, and complete linear-growth classification statements are correct. The proof of the final classification still omits a converse implication in version 2, but an explicit inverse-asymptotic repair verifies the theorem statement.
The Hardy-field Ramsey and density conclusions follow from the uniform exponential-sum input
PDF pp. 4–61 · Theorems 1.2–1.16 and §§3–7 · arXiv:2609.20727v2
The uniform Fourier estimate passes through spectral calculus to the ergodic approximation, and the finite-cyclic double counting yields the additive conclusions. The integer-polynomial parity obstruction, Hardy-field type division, coefficient restrictions, positive-density quantifiers, prime transference, and sparse-image counterexamples agree with the arguments used.
The linear-growth classification admits a complete repair
PDF pp. 61–66 · Theorem 7.3 and equations (81)–(88) · arXiv:2609.20727v2
Set , , and . The hypotheses give uniformly. Thus either strict phase inequality forces a sufficiently large integer into the image set, supplying the converse absent from the manuscript. A positive-density set has pairs in the two required ratio regimes, and at the boundary Lemma 7.5 supplies three phase pieces while the limiting nonrepresentation inequalities admit at most two values. This proves all three cases without altering the statement.
02Proofs4 reported findingsSuspected incomplete or incorrect proofs
The main analytic, ergodic, and combinatorial chains are verifiable. The printed proof of Theorem 7.3 still uses necessary phase inequalities in the converse direction, requiring the substantive repair above. Four additional local sign, derivative-order, shift, and notation corrections remain in version 2.
The exponential-sum, transference, and superlinear-obstruction arguments close
PDF pp. 11–61 · §§2–7 through Theorem 7.1 · arXiv:2609.20727v2
The sublinear and high- and low-degree special-part cases cover the Hardy-field decomposition, with Weyl-type estimates uniform on the required blocks. Herglotz reduction, cyclic double counting, the W-tricked polynomial construction, lacunary coloring, Bohr sets, and nonsurjective prime residues preserve the exact density and distinctness requirements.
Necessary phase bounds are used as though they were sufficient
PDF pp. 63–66 · equations (85)–(88) · arXiv:2609.20727v2
From a representation the paper obtains one of the two bounds in (86). Cases (a) and (c) infer simultaneous complementary bounds from the absence of representations, but the inverse implication is not proved. The inverse expansion and positive-density ratio argument recorded under Statements supplies that implication. Because it is a new proof-critical argument rather than explanatory algebra, the printed proof remains incomplete even though the theorem is verified.
The reduction omits negative unbounded remainders
PDF pp. 43 and 49–52 · Theorem 5.9 and its reduction · arXiv:2609.20727v2
The printed condition excludes positive functions such as , although Theorem 1.2 includes them. Use , choose the nearest integer multiple with either sign, and replace the one-sided estimate on by . Translation of the finite set and the boundary loss then work unchanged.
Three local formulas require their uniquely determined variants
PDF pp. 11, 31, and 49 · equation (16), definition of , proof of Corollary 5.10 · arXiv:2609.20727v2
Equation (16) needs because degree was defined for eventually negative germs too. If , need not be integral, so is undefined; set in that branch, which the later proof already treats separately. Finally, floor follows from the nearest-integer result for and ceiling from , whereas the two signs are printed in the opposite order.
03Novelty0 reported findingsNo novelty concerns found
No non-novelty findings.