The Uniformity Conjecture in Additive Combinatorics
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:LU3LD5JGrecord.jsonopen to challenge →
classification
math.CO
math.NT
keywords
additiveboundscombinatoricsconjectureapplicationsbombieri-langcardinalityexamples
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.