The Uniformity Conjecture in Additive Combinatorics

Ilya D. Shkredov; Jozsef Solymosi

REVIEW

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 2005.11559 v1 pith:LU3LD5JG submitted 2020-05-23 math.CO math.NT

The Uniformity Conjecture in Additive Combinatorics

Ilya D. Shkredov , Jozsef Solymosi This is my paper

classification math.CO math.NT

keywords additiveboundscombinatoricsconjectureapplicationsbombieri-langcardinalityexamples

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

0 comments

read the original abstract

In this paper we show examples for applications of the Bombieri-Lang conjecture in additive combinatorics, giving bounds on the cardinality of sumsets of squares and higher powers of integers. Using similar methods we give bounds on the sum-product problem for matchings.

The Uniformity Conjecture in Additive Combinatorics

discussion (0)