The size of coefficients of certain polynomials related to the Goldbach conjecture
Greg Martin, Charles L. Samuels

TL;DR
This paper studies the coefficients of polynomials related to the Goldbach conjecture, providing asymptotic formulas for their behavior both conditionally and unconditionally, advancing understanding of their properties.
Contribution
The authors improve previous bounds by deriving an asymptotic formula for the coefficients both conditionally and unconditionally, deepening insight into their structure.
Findings
Asymptotic formula for coefficients under Hardy-Littlewood conjecture
Unconditional asymptotic formula for the summatory function
Enhanced understanding of polynomial coefficients related to Goldbach
Abstract
Recent work of Borwein, Choi, and the second author examined a collection of polynomials closely related to the Goldbach conjecture: the polynomial is divisible by the th cyclotomic polynomial if and only if there is no representation of as the sum of two odd primes. The coefficients of these polynomials stabilize, as grows, to a fixed sequence ; they derived upper and lower bounds for , and an asymptotic formula for the summatory function of the sequence, both under the assumption of a famous conjecture of Hardy and Littlewood. In this article we improve these results: we obtain an asymptotic formula for under the same assumption, and we establish the asymptotic formula for unconditionally.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Coding theory and cryptography
