![Real Analysis in Computer Science_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Real%20Analysis%20in%20Computer%20Science_hi-res.jpg?h=e2b42a27&itok=jpgiJZrK)
Abstract
I will discuss joint work with Rob Morris on the issue of counting the number of sets A in Z/NZ of a given size with doubling constant at most K. I will also mention some applications, for example to the problem of estimating the probability that if S is a random set of natural numbers then all except k natural numbers are the sum of two elements of S, and to the problem of finding an asymptotic for the clique number of a random Cayley graph on Z/NZ.