A lower bound for |{a+b: a\in A, b\in B, P(a,b)\not=0}|

Hao Pan; Zhi-Wei Sun

REVIEW

A lower bound for |{a+b: ain A, bin B, P(a,b)not=0}|

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 math/0610892 v1 pith:5W7WRCNP submitted 2006-10-29 math.NT math.CO

A lower bound for |{a+b: ain A, bin B, P(a,b)not=0}|

Hao Pan , Zhi-Wei Sun This is my paper

classification math.NT math.CO

keywords boundlowerfieldfinitenontrivialsubsets

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

Let A and B be two finite subsets of a field F. In this paper we provide a nontrivial lower bound for |{a+b: a in A, b in B, and P(a,b) not=0}| where $P(x,y)\in F[x,y]$.

A lower bound for |{a+b: ain A, bin B, P(a,b)not=0}|

discussion (0)