Pith. sign in

REVIEW 1 cited by

Minor arcs for Goldbach's problem

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1205.5252 v4 pith:JRKUW7O2 submitted 2012-05-23 math.NT

classification math.NT
keywords arcsconjecturegoldbachminoralphaboundslargepart
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \sum_{p\leq x} e(\alpha p), \alpha = a/q + O(1/q^2), has been a central part of the main approach to the conjecture since (Vinogradov, 1937). Previous work required q or x to be too large to make a proof of the conjecture for all n feasible. The present paper gives new bounds on minor arcs and the tails of major arcs. This is part of the author's proof of the ternary Goldbach conjecture. The new bounds are due to several qualitative improvements. In particular, this paper presents a general method for reducing the cost of Vaughan's identity, as well as a way to exploit the tails of minor arcs in the context of the large sieve.

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. OpenAlex reports about 52 citations worldwide. Full citation record

  1. An Intuitionistic Glance at Primes

    math.LO 2025-11 reject novelty 3.0 of 10

    Claims a realizability barrier prevents Heyting Arithmetic from uniformly extracting prime witnesses, making Goldbach-type theorems constructively unrealizable; the barrier fails because primality is decidable by boun...

Pith tools