Elementary methods for convexity and sum sets, with an application to dot products

This talk will discuss how elementary methods can be used to prove results about superquadratic growth for certain expanders involving convex functions. We will then see how these results can be used to give an improved bound for the number of distinct dot products determined by a point set.
Conference ID: 942 0186 5629 Password is a six-digit number, the first three digits of which form the number p + 44, and the last three digits are the number q + 63, where p, q is the largest pair of twin primes less than 1000