On combinatorial compexity of convex sequences

Abstract

We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.

References in corpus (1)

• Some connections between Falconer's distance set conjecture, and sets of Furstenburg type