  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.
